H-Termination proof of /home/matraf/haskell/eval_FullyBlown

YES 17.673000000000002 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:

↳ HASKELL

  ↳ IFR

mainModule Main

((realToFrac :: Float -> Ratio Int) :: Float -> Ratio Int)

module Main where

import qualified Prelude

If Reductions:
The following If expression

if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero

is transformed to

primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y))

primDivNatS0 x y False = Zero

The following If expression

if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x

is transformed to

primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y)

primModNatS0 x y False = Succ x

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Main

((realToFrac :: Float -> Ratio Int) :: Float -> Ratio Int)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Main

((realToFrac :: Float -> Ratio Int) :: Float -> Ratio Int)

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

The following Function with conditions

gcd 0 0 = error []

gcd x y =

gcd' (abs x) (abs y)

where

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd yz zu = gcd3 yz zu

gcd x y = gcd0 x y

gcd0 x y =

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

gcd1 True yz zu = error []

gcd1 zv zw zx = gcd0 zw zx

gcd2 True yz zu = gcd1 (zu == 0) yz zu

gcd2 zy zz vuu = gcd0 zz vuu

gcd3 yz zu = gcd2 (yz == 0) yz zu

gcd3 vuv vuw = gcd0 vuv vuw

The following Function with conditions

absReal x

| x >= 0

= x

| otherwise

= `negate` x

is transformed to

absReal x = absReal2 x

absReal0 x True = `negate` x

absReal1 x True = x

absReal1 x False = absReal0 x otherwise

absReal2 x = absReal1 x (x >= 0)

The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

reduce x y

| y == 0

= error []

| otherwise

= x `quot` d :% (y `quot` d)

where

d = gcd x y

is transformed to

reduce x y = reduce2 x y

reduce2 x y =

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

The following Function with conditions

signumReal x

| x == 0

= 0

| x > 0

= 1

| otherwise

= -1

is transformed to

signumReal x = signumReal3 x

signumReal1 x True = 1

signumReal1 x False = signumReal0 x otherwise

signumReal2 x True = 0

signumReal2 x False = signumReal1 x (x > 0)

signumReal0 x True = -1

signumReal3 x = signumReal2 x (x == 0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

mainModule Main

((realToFrac :: Float -> Ratio Int) :: Float -> Ratio Int)

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

are unpacked to the following functions on top level

reduce2Reduce1 vux vuy x y True = error []

reduce2Reduce1 vux vuy x y False = reduce2Reduce0 vux vuy x y otherwise

reduce2D vux vuy = gcd vux vuy

reduce2Reduce0 vux vuy x y True = x `quot` reduce2D vux vuy :% (y `quot` reduce2D vux vuy)

The bindings of the following Let/Where expression

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

are unpacked to the following functions on top level

gcd0Gcd'0 x y = gcd0Gcd' y (x `rem` y)

gcd0Gcd' x xz = gcd0Gcd'2 x xz

gcd0Gcd' x y = gcd0Gcd'0 x y

gcd0Gcd'2 x xz = gcd0Gcd'1 (xz == 0) x xz

gcd0Gcd'2 yx yy = gcd0Gcd'0 yx yy

gcd0Gcd'1 True x xz = x

gcd0Gcd'1 yu yv yw = gcd0Gcd'0 yv yw

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

mainModule Main

((realToFrac :: Float -> Ratio Int) :: Float -> Ratio Int)

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

mainModule Main

(realToFrac :: Float -> Ratio Int)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="realToFrac",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="realToFrac vuz3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="fromRational . toRational",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="fromRational (toRational vuz3)",fontsize=16,color="black",shape="box"];5 -> 1245[label="",style="solid", color="black", weight=3];
1245 -> 1160[label="",style="dashed", color="red", weight=0];
1245[label="fromRational (floatToRational vuz3)",fontsize=16,color="magenta"];1245 -> 1610[label="",style="dashed", color="magenta", weight=3];
1610 -> 1158[label="",style="dashed", color="red", weight=0];
1610[label="floatToRational vuz3",fontsize=16,color="magenta"];1160[label="fromRational vuz32\n  Integral a",fontsize=16,color="burlywood",shape="triangle"];5474[label="vuz32/vuz320 :% vuz321",fontsize=10,color="white",style="solid",shape="box"];1160 -> 5474[label="",style="solid", color="burlywood", weight=9];
5474 -> 1517[label="",style="solid", color="burlywood", weight=3];
1158[label="floatToRational vuz3",fontsize=16,color="burlywood",shape="triangle"];5475[label="vuz3/Float vuz30 vuz31",fontsize=10,color="white",style="solid",shape="box"];1158 -> 5475[label="",style="solid", color="burlywood", weight=9];
5475 -> 1162[label="",style="solid", color="burlywood", weight=3];
1517[label="fromRational (vuz320 :% vuz321)\n  Integral a",fontsize=16,color="black",shape="box"];1517 -> 1891[label="",style="solid", color="black", weight=3];
1162[label="floatToRational (Float vuz30 vuz31)",fontsize=16,color="black",shape="box"];1162 -> 1519[label="",style="solid", color="black", weight=3];
1891[label="fromInteger vuz320 :% fromInteger vuz321\n  Integral a",fontsize=16,color="green",shape="box"];1891 -> 2523[label="",style="dashed", color="green", weight=3];
1891 -> 2524[label="",style="dashed", color="green", weight=3];
1519[label="Integer vuz30 % Integer vuz31",fontsize=16,color="black",shape="box"];1519 -> 1892[label="",style="solid", color="black", weight=3];
2523[label="fromInteger vuz320\n  Integral a",fontsize=16,color="blue",shape="box"];5476[label="fromInteger :: Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];2523 -> 5476[label="",style="solid", color="blue", weight=9];
5476 -> 2911[label="",style="solid", color="blue", weight=3];
5477[label="fromInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];2523 -> 5477[label="",style="solid", color="blue", weight=9];
5477 -> 2912[label="",style="solid", color="blue", weight=3];
2524[label="fromInteger vuz321\n  Integral a",fontsize=16,color="blue",shape="box"];5478[label="fromInteger :: Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];2524 -> 5478[label="",style="solid", color="blue", weight=9];
5478 -> 2913[label="",style="solid", color="blue", weight=3];
5479[label="fromInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];2524 -> 5479[label="",style="solid", color="blue", weight=9];
5479 -> 2914[label="",style="solid", color="blue", weight=3];
1892 -> 1630[label="",style="dashed", color="red", weight=0];
1892[label="reduce (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="magenta"];2911[label="fromInteger vuz320",fontsize=16,color="burlywood",shape="triangle"];5481[label="vuz320/Integer vuz3200",fontsize=10,color="white",style="solid",shape="box"];2911 -> 5481[label="",style="solid", color="burlywood", weight=9];
5481 -> 2917[label="",style="solid", color="burlywood", weight=3];
2912[label="fromInteger vuz320",fontsize=16,color="black",shape="triangle"];2912 -> 2918[label="",style="solid", color="black", weight=3];
2913 -> 2911[label="",style="dashed", color="red", weight=0];
2913[label="fromInteger vuz321",fontsize=16,color="magenta"];2913 -> 2919[label="",style="dashed", color="magenta", weight=3];
2914 -> 2912[label="",style="dashed", color="red", weight=0];
2914[label="fromInteger vuz321",fontsize=16,color="magenta"];2914 -> 2920[label="",style="dashed", color="magenta", weight=3];
1630[label="reduce (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="triangle"];1630 -> 2076[label="",style="solid", color="black", weight=3];
2917[label="fromInteger (Integer vuz3200)",fontsize=16,color="black",shape="box"];2917 -> 2925[label="",style="solid", color="black", weight=3];
2918[label="error []",fontsize=16,color="red",shape="box"];2919[label="vuz321",fontsize=16,color="green",shape="box"];2920[label="vuz321",fontsize=16,color="green",shape="box"];2076 -> 1782[label="",style="dashed", color="red", weight=0];
2076[label="reduce2 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="magenta"];2925[label="vuz3200",fontsize=16,color="green",shape="box"];1782[label="reduce2 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="triangle"];1782 -> 2338[label="",style="solid", color="black", weight=3];
2338 -> 1711[label="",style="dashed", color="red", weight=0];
2338[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (abs (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1711[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (abs (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1711 -> 2220[label="",style="solid", color="black", weight=3];
2220 -> 1715[label="",style="dashed", color="red", weight=0];
2220[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (absReal (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1715[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (absReal (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1715 -> 2227[label="",style="solid", color="black", weight=3];
2227 -> 1663[label="",style="dashed", color="red", weight=0];
2227[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (absReal2 (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1663[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (absReal2 (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1663 -> 2137[label="",style="solid", color="black", weight=3];
2137 -> 1645[label="",style="dashed", color="red", weight=0];
2137[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1645[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1645 -> 2102[label="",style="solid", color="black", weight=3];
2102 -> 1523[label="",style="dashed", color="red", weight=0];
2102[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1523[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1523 -> 1899[label="",style="solid", color="black", weight=3];
1899 -> 1790[label="",style="dashed", color="red", weight=0];
1899[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1790[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1790 -> 2353[label="",style="solid", color="black", weight=3];
2353 -> 1870[label="",style="dashed", color="red", weight=0];
2353[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="magenta"];1870[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="triangle"];1870 -> 2487[label="",style="solid", color="black", weight=3];
2487[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];5492[label="vuz31/Pos vuz310",fontsize=10,color="white",style="solid",shape="box"];2487 -> 5492[label="",style="solid", color="burlywood", weight=9];
5492 -> 2915[label="",style="solid", color="burlywood", weight=3];
5493[label="vuz31/Neg vuz310",fontsize=10,color="white",style="solid",shape="box"];2487 -> 5493[label="",style="solid", color="burlywood", weight=9];
5493 -> 2916[label="",style="solid", color="burlywood", weight=3];
2915[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];5494[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];2915 -> 5494[label="",style="solid", color="burlywood", weight=9];
5494 -> 2921[label="",style="solid", color="burlywood", weight=3];
5495[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];2915 -> 5495[label="",style="solid", color="burlywood", weight=9];
5495 -> 2922[label="",style="solid", color="burlywood", weight=3];
2916[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];5496[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];2916 -> 5496[label="",style="solid", color="burlywood", weight=9];
5496 -> 2923[label="",style="solid", color="burlywood", weight=3];
5497[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];2916 -> 5497[label="",style="solid", color="burlywood", weight=9];
5497 -> 2924[label="",style="solid", color="burlywood", weight=3];
2921[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2921 -> 2926[label="",style="solid", color="black", weight=3];
2922[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2922 -> 2927[label="",style="solid", color="black", weight=3];
2923[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2923 -> 2928[label="",style="solid", color="black", weight=3];
2924[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2924 -> 2929[label="",style="solid", color="black", weight=3];
2926[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2926 -> 2930[label="",style="solid", color="black", weight=3];
2927[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2927 -> 2931[label="",style="solid", color="black", weight=3];
2928[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2928 -> 2932[label="",style="solid", color="black", weight=3];
2929[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2929 -> 2933[label="",style="solid", color="black", weight=3];
2930[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2930 -> 2934[label="",style="solid", color="black", weight=3];
2931[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (absReal1 (Integer (Pos Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2931 -> 2935[label="",style="solid", color="black", weight=3];
2932[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (absReal1 (Integer (Neg (Succ vuz3100))) (not True) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2932 -> 2936[label="",style="solid", color="black", weight=3];
2933[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (absReal1 (Integer (Neg Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2933 -> 2937[label="",style="solid", color="black", weight=3];
2934[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2934 -> 2938[label="",style="solid", color="black", weight=3];
2935[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (absReal1 (Integer (Pos Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2935 -> 2939[label="",style="solid", color="black", weight=3];
2936[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (absReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2936 -> 2940[label="",style="solid", color="black", weight=3];
2937[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (absReal1 (Integer (Neg Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2937 -> 2941[label="",style="solid", color="black", weight=3];
2938[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2938 -> 2942[label="",style="solid", color="black", weight=3];
2939[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2939 -> 2943[label="",style="solid", color="black", weight=3];
2940[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2940 -> 2944[label="",style="solid", color="black", weight=3];
2941[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2941 -> 2945[label="",style="solid", color="black", weight=3];
2942[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2942 -> 2946[label="",style="solid", color="black", weight=3];
2943[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2943 -> 2947[label="",style="solid", color="black", weight=3];
2944[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (absReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2944 -> 2948[label="",style="solid", color="black", weight=3];
2945[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2945 -> 2949[label="",style="solid", color="black", weight=3];
2946[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2946 -> 2950[label="",style="solid", color="black", weight=3];
2947[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];2947 -> 2951[label="",style="solid", color="black", weight=3];
2948[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (`negate` Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2948 -> 2952[label="",style="solid", color="black", weight=3];
2949[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];2949 -> 2953[label="",style="solid", color="black", weight=3];
2950[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];2950 -> 2954[label="",style="solid", color="black", weight=3];
2951[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];2951 -> 2955[label="",style="solid", color="black", weight=3];
2952[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];2952 -> 2956[label="",style="solid", color="black", weight=3];
2953[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];2953 -> 2957[label="",style="solid", color="black", weight=3];
2954[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];2954 -> 2958[label="",style="solid", color="black", weight=3];
2955[label="error []",fontsize=16,color="black",shape="triangle"];2955 -> 2959[label="",style="solid", color="black", weight=3];
2956[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2956 -> 2960[label="",style="solid", color="black", weight=3];
2957 -> 2955[label="",style="dashed", color="red", weight=0];
2957[label="error []",fontsize=16,color="magenta"];2958[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];2958 -> 2961[label="",style="solid", color="black", weight=3];
2959[label="error []",fontsize=16,color="red",shape="box"];2960[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (primEqInt (primNegInt (Neg (Succ vuz3100))) (Pos Zero))",fontsize=16,color="black",shape="box"];2960 -> 2962[label="",style="solid", color="black", weight=3];
2961[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];2961 -> 2963[label="",style="solid", color="black", weight=3];
2962[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];2962 -> 2964[label="",style="solid", color="black", weight=3];
2963[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];2963 -> 2965[label="",style="dashed", color="green", weight=3];
2963 -> 2966[label="",style="dashed", color="green", weight=3];
2964[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];2964 -> 2967[label="",style="solid", color="black", weight=3];
2965[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2965 -> 2968[label="",style="solid", color="black", weight=3];
2966[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2966 -> 2969[label="",style="solid", color="black", weight=3];
2967[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];2967 -> 2970[label="",style="solid", color="black", weight=3];
2968[label="Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2968 -> 2971[label="",style="solid", color="black", weight=3];
2969[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2969 -> 2972[label="",style="solid", color="black", weight=3];
2970[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];2970 -> 2973[label="",style="solid", color="black", weight=3];
2971[label="Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2971 -> 2974[label="",style="solid", color="black", weight=3];
2972[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2972 -> 2975[label="",style="solid", color="black", weight=3];
2973[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];2973 -> 2976[label="",style="dashed", color="green", weight=3];
2973 -> 2977[label="",style="dashed", color="green", weight=3];
2974[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2974 -> 2978[label="",style="solid", color="black", weight=3];
2975[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2975 -> 2979[label="",style="solid", color="black", weight=3];
2976[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2976 -> 2980[label="",style="solid", color="black", weight=3];
2977[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2977 -> 2981[label="",style="solid", color="black", weight=3];
2978[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2978 -> 2982[label="",style="solid", color="black", weight=3];
2979[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2979 -> 2983[label="",style="solid", color="black", weight=3];
2980[label="Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2980 -> 2984[label="",style="solid", color="black", weight=3];
2981[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2981 -> 2985[label="",style="solid", color="black", weight=3];
2982[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2982 -> 2986[label="",style="solid", color="black", weight=3];
2983[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2983 -> 2987[label="",style="solid", color="black", weight=3];
2984[label="Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2984 -> 2988[label="",style="solid", color="black", weight=3];
2985[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2985 -> 2989[label="",style="solid", color="black", weight=3];
2986[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2986 -> 2990[label="",style="solid", color="black", weight=3];
2987[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2987 -> 2991[label="",style="solid", color="black", weight=3];
2988[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2988 -> 2992[label="",style="solid", color="black", weight=3];
2989[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2989 -> 2993[label="",style="solid", color="black", weight=3];
2990[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2990 -> 2994[label="",style="solid", color="black", weight=3];
2991[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2991 -> 2995[label="",style="solid", color="black", weight=3];
2992[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2992 -> 2996[label="",style="solid", color="black", weight=3];
2993[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2993 -> 2997[label="",style="solid", color="black", weight=3];
2994[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2994 -> 2998[label="",style="solid", color="black", weight=3];
2995[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2995 -> 2999[label="",style="solid", color="black", weight=3];
2996[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2996 -> 3000[label="",style="solid", color="black", weight=3];
2997[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2997 -> 3001[label="",style="solid", color="black", weight=3];
2998[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2998 -> 3002[label="",style="solid", color="black", weight=3];
2999[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];2999 -> 3003[label="",style="solid", color="black", weight=3];
3000[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3000 -> 3004[label="",style="solid", color="black", weight=3];
3001[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3001 -> 3005[label="",style="solid", color="black", weight=3];
3002[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3002 -> 3006[label="",style="solid", color="black", weight=3];
3003[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3003 -> 3007[label="",style="solid", color="black", weight=3];
3004[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3004 -> 3008[label="",style="solid", color="black", weight=3];
3005[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3005 -> 3009[label="",style="solid", color="black", weight=3];
3006[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3006 -> 3010[label="",style="solid", color="black", weight=3];
3007[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3007 -> 3011[label="",style="solid", color="black", weight=3];
3008[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3008 -> 3012[label="",style="solid", color="black", weight=3];
3009[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3009 -> 3013[label="",style="solid", color="black", weight=3];
3010[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3010 -> 3014[label="",style="solid", color="black", weight=3];
3011[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3011 -> 3015[label="",style="solid", color="black", weight=3];
3012[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3012 -> 3016[label="",style="solid", color="black", weight=3];
3013[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3013 -> 3017[label="",style="solid", color="black", weight=3];
3014[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3014 -> 3018[label="",style="solid", color="black", weight=3];
3015[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3015 -> 3019[label="",style="solid", color="black", weight=3];
3016[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3016 -> 3020[label="",style="solid", color="black", weight=3];
3017[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3017 -> 3021[label="",style="solid", color="black", weight=3];
3018[label="Integer vuz30 * fromInt (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3018 -> 3022[label="",style="solid", color="black", weight=3];
3019[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3019 -> 3023[label="",style="solid", color="black", weight=3];
3020[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3020 -> 3024[label="",style="solid", color="black", weight=3];
3021[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3021 -> 3025[label="",style="solid", color="black", weight=3];
3022[label="Integer vuz30 * Integer (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3022 -> 3026[label="",style="solid", color="black", weight=3];
3023[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3023 -> 3027[label="",style="solid", color="black", weight=3];
3024[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3024 -> 3028[label="",style="solid", color="black", weight=3];
3025[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3025 -> 3029[label="",style="solid", color="black", weight=3];
3026[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3026 -> 3030[label="",style="solid", color="black", weight=3];
3027[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3027 -> 3031[label="",style="solid", color="black", weight=3];
3028[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3028 -> 3032[label="",style="solid", color="black", weight=3];
3029[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3029 -> 3033[label="",style="solid", color="black", weight=3];
3030[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3030 -> 3034[label="",style="solid", color="black", weight=3];
3031[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3031 -> 3035[label="",style="solid", color="black", weight=3];
3032[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3032 -> 3036[label="",style="solid", color="black", weight=3];
3033[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3033 -> 3037[label="",style="solid", color="black", weight=3];
3034[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3034 -> 3038[label="",style="solid", color="black", weight=3];
3035[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3035 -> 3039[label="",style="solid", color="black", weight=3];
3036[label="Integer vuz30 * fromInt (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3036 -> 3040[label="",style="solid", color="black", weight=3];
3037[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3037 -> 3041[label="",style="solid", color="black", weight=3];
3038[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3038 -> 3042[label="",style="solid", color="black", weight=3];
3039[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3039 -> 3043[label="",style="solid", color="black", weight=3];
3040[label="Integer vuz30 * Integer (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3040 -> 3044[label="",style="solid", color="black", weight=3];
3041[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3041 -> 3045[label="",style="solid", color="black", weight=3];
3042[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3042 -> 3046[label="",style="solid", color="black", weight=3];
3043[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3043 -> 3047[label="",style="solid", color="black", weight=3];
3044[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3044 -> 3048[label="",style="solid", color="black", weight=3];
3045[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3045 -> 3049[label="",style="solid", color="black", weight=3];
3046[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];5499[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];3046 -> 5499[label="",style="solid", color="burlywood", weight=9];
5499 -> 3050[label="",style="solid", color="burlywood", weight=3];
5500[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];3046 -> 5500[label="",style="solid", color="burlywood", weight=9];
5500 -> 3051[label="",style="solid", color="burlywood", weight=3];
3047[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];5501[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];3047 -> 5501[label="",style="solid", color="burlywood", weight=9];
5501 -> 3052[label="",style="solid", color="burlywood", weight=3];
5502[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];3047 -> 5502[label="",style="solid", color="burlywood", weight=9];
5502 -> 3053[label="",style="solid", color="burlywood", weight=3];
3048[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3048 -> 3054[label="",style="solid", color="black", weight=3];
3049[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3049 -> 3055[label="",style="solid", color="black", weight=3];
3050[label="Integer (primMulInt (Pos vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3050 -> 3056[label="",style="solid", color="black", weight=3];
3051[label="Integer (primMulInt (Neg vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3051 -> 3057[label="",style="solid", color="black", weight=3];
3052[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3052 -> 3058[label="",style="solid", color="black", weight=3];
3053[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3053 -> 3059[label="",style="solid", color="black", weight=3];
3054[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3054 -> 3060[label="",style="solid", color="black", weight=3];
3055[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3055 -> 3061[label="",style="solid", color="black", weight=3];
3056[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];5503[label="vuz300/Succ vuz3000",fontsize=10,color="white",style="solid",shape="box"];3056 -> 5503[label="",style="solid", color="burlywood", weight=9];
5503 -> 3062[label="",style="solid", color="burlywood", weight=3];
5504[label="vuz300/Zero",fontsize=10,color="white",style="solid",shape="box"];3056 -> 5504[label="",style="solid", color="burlywood", weight=9];
5504 -> 3063[label="",style="solid", color="burlywood", weight=3];
3057[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];5505[label="vuz300/Succ vuz3000",fontsize=10,color="white",style="solid",shape="box"];3057 -> 5505[label="",style="solid", color="burlywood", weight=9];
5505 -> 3064[label="",style="solid", color="burlywood", weight=3];
5506[label="vuz300/Zero",fontsize=10,color="white",style="solid",shape="box"];3057 -> 5506[label="",style="solid", color="burlywood", weight=9];
5506 -> 3065[label="",style="solid", color="burlywood", weight=3];
3058 -> 3400[label="",style="dashed", color="red", weight=0];
3058[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3058 -> 3401[label="",style="dashed", color="magenta", weight=3];
3058 -> 3402[label="",style="dashed", color="magenta", weight=3];
3059 -> 3458[label="",style="dashed", color="red", weight=0];
3059[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3059 -> 3459[label="",style="dashed", color="magenta", weight=3];
3059 -> 3460[label="",style="dashed", color="magenta", weight=3];
3060[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3060 -> 3070[label="",style="solid", color="black", weight=3];
3061[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3061 -> 3071[label="",style="solid", color="black", weight=3];
3062[label="Integer (Pos (primMulNat (Succ vuz3000) (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat (Succ vuz3000) (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat (Succ vuz3000) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3062 -> 3072[label="",style="solid", color="black", weight=3];
3063[label="Integer (Pos (primMulNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3063 -> 3073[label="",style="solid", color="black", weight=3];
3064[label="Integer (Neg (primMulNat (Succ vuz3000) (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat (Succ vuz3000) (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat (Succ vuz3000) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3064 -> 3074[label="",style="solid", color="black", weight=3];
3065[label="Integer (Neg (primMulNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat Zero (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3065 -> 3075[label="",style="solid", color="black", weight=3];
3401 -> 3311[label="",style="dashed", color="red", weight=0];
3401[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3401 -> 3446[label="",style="dashed", color="magenta", weight=3];
3402 -> 3311[label="",style="dashed", color="red", weight=0];
3402[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3402 -> 3447[label="",style="dashed", color="magenta", weight=3];
3400[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos vuz51) (Pos Zero)) (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];5511[label="vuz51/Succ vuz510",fontsize=10,color="white",style="solid",shape="box"];3400 -> 5511[label="",style="solid", color="burlywood", weight=9];
5511 -> 3448[label="",style="solid", color="burlywood", weight=3];
5512[label="vuz51/Zero",fontsize=10,color="white",style="solid",shape="box"];3400 -> 5512[label="",style="solid", color="burlywood", weight=9];
5512 -> 3449[label="",style="solid", color="burlywood", weight=3];
3459 -> 3311[label="",style="dashed", color="red", weight=0];
3459[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3459 -> 3504[label="",style="dashed", color="magenta", weight=3];
3460 -> 3311[label="",style="dashed", color="red", weight=0];
3460[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3460 -> 3505[label="",style="dashed", color="magenta", weight=3];
3458[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg vuz65) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];5515[label="vuz65/Succ vuz650",fontsize=10,color="white",style="solid",shape="box"];3458 -> 5515[label="",style="solid", color="burlywood", weight=9];
5515 -> 3506[label="",style="solid", color="burlywood", weight=3];
5516[label="vuz65/Zero",fontsize=10,color="white",style="solid",shape="box"];3458 -> 5516[label="",style="solid", color="burlywood", weight=9];
5516 -> 3507[label="",style="solid", color="burlywood", weight=3];
3070[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3070 -> 3080[label="",style="solid", color="black", weight=3];
3071[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3071 -> 3081[label="",style="solid", color="black", weight=3];
3072 -> 3310[label="",style="dashed", color="red", weight=0];
3072[label="Integer (Pos (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3072 -> 3311[label="",style="dashed", color="magenta", weight=3];
3072 -> 3312[label="",style="dashed", color="magenta", weight=3];
3073[label="Integer (Pos Zero) `quot` gcd2 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3073 -> 3084[label="",style="solid", color="black", weight=3];
3074 -> 3355[label="",style="dashed", color="red", weight=0];
3074[label="Integer (Neg (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3074 -> 3356[label="",style="dashed", color="magenta", weight=3];
3074 -> 3357[label="",style="dashed", color="magenta", weight=3];
3075[label="Integer (Neg Zero) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3075 -> 3087[label="",style="solid", color="black", weight=3];
3446[label="vuz300",fontsize=16,color="green",shape="box"];3311[label="primMulNat vuz3000 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];5519[label="vuz3000/Succ vuz30000",fontsize=10,color="white",style="solid",shape="box"];3311 -> 5519[label="",style="solid", color="burlywood", weight=9];
5519 -> 3343[label="",style="solid", color="burlywood", weight=3];
5520[label="vuz3000/Zero",fontsize=10,color="white",style="solid",shape="box"];3311 -> 5520[label="",style="solid", color="burlywood", weight=9];
5520 -> 3344[label="",style="solid", color="burlywood", weight=3];
3447[label="vuz300",fontsize=16,color="green",shape="box"];3448[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (Succ vuz510)) (Pos Zero)) (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3448 -> 3508[label="",style="solid", color="black", weight=3];
3449[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3449 -> 3509[label="",style="solid", color="black", weight=3];
3504[label="vuz300",fontsize=16,color="green",shape="box"];3505[label="vuz300",fontsize=16,color="green",shape="box"];3506[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (Succ vuz650)) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3506 -> 3518[label="",style="solid", color="black", weight=3];
3507[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3507 -> 3519[label="",style="solid", color="black", weight=3];
3080[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];5521[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];3080 -> 5521[label="",style="solid", color="burlywood", weight=9];
5521 -> 3094[label="",style="solid", color="burlywood", weight=3];
5522[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];3080 -> 5522[label="",style="solid", color="burlywood", weight=9];
5522 -> 3095[label="",style="solid", color="burlywood", weight=3];
3081[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];5523[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];3081 -> 5523[label="",style="solid", color="burlywood", weight=9];
5523 -> 3096[label="",style="solid", color="burlywood", weight=3];
5524[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];3081 -> 5524[label="",style="solid", color="burlywood", weight=9];
5524 -> 3097[label="",style="solid", color="burlywood", weight=3];
3312[label="vuz3100",fontsize=16,color="green",shape="box"];3310[label="Integer (Pos (primPlusNat vuz41 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat vuz41 (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat vuz41 (Succ Zero)))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="burlywood",shape="triangle"];5525[label="vuz41/Succ vuz410",fontsize=10,color="white",style="solid",shape="box"];3310 -> 5525[label="",style="solid", color="burlywood", weight=9];
5525 -> 3345[label="",style="solid", color="burlywood", weight=3];
5526[label="vuz41/Zero",fontsize=10,color="white",style="solid",shape="box"];3310 -> 5526[label="",style="solid", color="burlywood", weight=9];
5526 -> 3346[label="",style="solid", color="burlywood", weight=3];
3084[label="Integer (Pos Zero) `quot` gcd2 True (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3084 -> 3100[label="",style="solid", color="black", weight=3];
3356[label="vuz3100",fontsize=16,color="green",shape="box"];3357 -> 3311[label="",style="dashed", color="red", weight=0];
3357[label="primMulNat vuz3000 (Succ Zero)",fontsize=16,color="magenta"];3357 -> 3388[label="",style="dashed", color="magenta", weight=3];
3355[label="Integer (Neg (primPlusNat vuz47 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat vuz47 (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat vuz47 (Succ Zero)))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="burlywood",shape="triangle"];5528[label="vuz47/Succ vuz470",fontsize=10,color="white",style="solid",shape="box"];3355 -> 5528[label="",style="solid", color="burlywood", weight=9];
5528 -> 3389[label="",style="solid", color="burlywood", weight=3];
5529[label="vuz47/Zero",fontsize=10,color="white",style="solid",shape="box"];3355 -> 5529[label="",style="solid", color="burlywood", weight=9];
5529 -> 3390[label="",style="solid", color="burlywood", weight=3];
3087[label="Integer (Neg Zero) `quot` gcd2 True (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3087 -> 3103[label="",style="solid", color="black", weight=3];
3343[label="primMulNat (Succ vuz30000) (Succ Zero)",fontsize=16,color="black",shape="box"];3343 -> 3351[label="",style="solid", color="black", weight=3];
3344[label="primMulNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];3344 -> 3352[label="",style="solid", color="black", weight=3];
3508[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 False (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3508 -> 3520[label="",style="solid", color="black", weight=3];
3509[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 True (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3509 -> 3521[label="",style="solid", color="black", weight=3];
3518[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 False (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3518 -> 3529[label="",style="solid", color="black", weight=3];
3519[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 True (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3519 -> 3530[label="",style="solid", color="black", weight=3];
3094[label="Integer (primMulInt (Pos vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3094 -> 3110[label="",style="solid", color="black", weight=3];
3095[label="Integer (primMulInt (Neg vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3095 -> 3111[label="",style="solid", color="black", weight=3];
3096[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3096 -> 3112[label="",style="solid", color="black", weight=3];
3097[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3097 -> 3113[label="",style="solid", color="black", weight=3];
3345[label="Integer (Pos (primPlusNat (Succ vuz410) (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat (Succ vuz410) (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat (Succ vuz410) (Succ Zero)))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3345 -> 3353[label="",style="solid", color="black", weight=3];
3346[label="Integer (Pos (primPlusNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3346 -> 3354[label="",style="solid", color="black", weight=3];
3100[label="Integer (Pos Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3100 -> 3117[label="",style="solid", color="black", weight=3];
3388[label="vuz3000",fontsize=16,color="green",shape="box"];3389[label="Integer (Neg (primPlusNat (Succ vuz470) (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat (Succ vuz470) (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat (Succ vuz470) (Succ Zero)))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3389 -> 3393[label="",style="solid", color="black", weight=3];
3390[label="Integer (Neg (primPlusNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat Zero (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3390 -> 3394[label="",style="solid", color="black", weight=3];
3103[label="Integer (Neg Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3103 -> 3121[label="",style="solid", color="black", weight=3];
3351 -> 3391[label="",style="dashed", color="red", weight=0];
3351[label="primPlusNat (primMulNat vuz30000 (Succ Zero)) (Succ Zero)",fontsize=16,color="magenta"];3351 -> 3392[label="",style="dashed", color="magenta", weight=3];
3352[label="Zero",fontsize=16,color="green",shape="box"];3520[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];3520 -> 3531[label="",style="solid", color="black", weight=3];
3521[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3521 -> 3532[label="",style="solid", color="black", weight=3];
3529[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];3529 -> 3536[label="",style="solid", color="black", weight=3];
3530[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3530 -> 3537[label="",style="solid", color="black", weight=3];
3110 -> 3057[label="",style="dashed", color="red", weight=0];
3110[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3110 -> 3130[label="",style="dashed", color="magenta", weight=3];
3110 -> 3131[label="",style="dashed", color="magenta", weight=3];
3111 -> 3056[label="",style="dashed", color="red", weight=0];
3111[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3111 -> 3132[label="",style="dashed", color="magenta", weight=3];
3111 -> 3133[label="",style="dashed", color="magenta", weight=3];
3112 -> 3458[label="",style="dashed", color="red", weight=0];
3112[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3112 -> 3469[label="",style="dashed", color="magenta", weight=3];
3112 -> 3470[label="",style="dashed", color="magenta", weight=3];
3112 -> 3471[label="",style="dashed", color="magenta", weight=3];
3113 -> 3400[label="",style="dashed", color="red", weight=0];
3113[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3113 -> 3411[label="",style="dashed", color="magenta", weight=3];
3113 -> 3412[label="",style="dashed", color="magenta", weight=3];
3113 -> 3413[label="",style="dashed", color="magenta", weight=3];
3353[label="Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))) `quot` gcd2 (primEqInt (Pos (Succ (Succ (primPlusNat vuz410 Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3353 -> 3395[label="",style="solid", color="black", weight=3];
3354[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3354 -> 3396[label="",style="solid", color="black", weight=3];
3117[label="Integer (Pos Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3117 -> 3141[label="",style="solid", color="black", weight=3];
3393[label="Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero)))) `quot` gcd2 (primEqInt (Neg (Succ (Succ (primPlusNat vuz470 Zero)))) (Pos Zero)) (Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3393 -> 3450[label="",style="solid", color="black", weight=3];
3394[label="Integer (Neg (Succ Zero)) `quot` gcd2 (primEqInt (Neg (Succ Zero)) (Pos Zero)) (Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3394 -> 3451[label="",style="solid", color="black", weight=3];
3121[label="Integer (Neg Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3121 -> 3145[label="",style="solid", color="black", weight=3];
3392 -> 3311[label="",style="dashed", color="red", weight=0];
3392[label="primMulNat vuz30000 (Succ Zero)",fontsize=16,color="magenta"];3392 -> 3397[label="",style="dashed", color="magenta", weight=3];
3391[label="primPlusNat vuz49 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];5536[label="vuz49/Succ vuz490",fontsize=10,color="white",style="solid",shape="box"];3391 -> 5536[label="",style="solid", color="burlywood", weight=9];
5536 -> 3398[label="",style="solid", color="burlywood", weight=3];
5537[label="vuz49/Zero",fontsize=10,color="white",style="solid",shape="box"];3391 -> 5537[label="",style="solid", color="burlywood", weight=9];
5537 -> 3399[label="",style="solid", color="burlywood", weight=3];
3531[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (abs (Integer (Pos vuz50))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3531 -> 3538[label="",style="solid", color="black", weight=3];
3532[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3532 -> 3539[label="",style="solid", color="black", weight=3];
3536[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (abs (Integer (Neg vuz64))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3536 -> 3544[label="",style="solid", color="black", weight=3];
3537[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3537 -> 3545[label="",style="solid", color="black", weight=3];
3130[label="vuz3100",fontsize=16,color="green",shape="box"];3131[label="vuz300",fontsize=16,color="green",shape="box"];3132[label="vuz3100",fontsize=16,color="green",shape="box"];3133[label="vuz300",fontsize=16,color="green",shape="box"];3469[label="vuz3100",fontsize=16,color="green",shape="box"];3470 -> 3311[label="",style="dashed", color="red", weight=0];
3470[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3470 -> 3510[label="",style="dashed", color="magenta", weight=3];
3471 -> 3311[label="",style="dashed", color="red", weight=0];
3471[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3471 -> 3511[label="",style="dashed", color="magenta", weight=3];
3411 -> 3311[label="",style="dashed", color="red", weight=0];
3411[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3411 -> 3452[label="",style="dashed", color="magenta", weight=3];
3412[label="vuz3100",fontsize=16,color="green",shape="box"];3413 -> 3311[label="",style="dashed", color="red", weight=0];
3413[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];3413 -> 3453[label="",style="dashed", color="magenta", weight=3];
3395[label="Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))) `quot` gcd2 False (Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3395 -> 3454[label="",style="solid", color="black", weight=3];
3396[label="Integer (Pos (Succ Zero)) `quot` gcd2 False (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3396 -> 3455[label="",style="solid", color="black", weight=3];
3141[label="Integer (Pos Zero) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3141 -> 3158[label="",style="solid", color="black", weight=3];
3450[label="Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero)))) `quot` gcd2 False (Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3450 -> 3512[label="",style="solid", color="black", weight=3];
3451[label="Integer (Neg (Succ Zero)) `quot` gcd2 False (Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3451 -> 3513[label="",style="solid", color="black", weight=3];
3145[label="Integer (Neg Zero) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3145 -> 3163[label="",style="solid", color="black", weight=3];
3397[label="vuz30000",fontsize=16,color="green",shape="box"];3398[label="primPlusNat (Succ vuz490) (Succ Zero)",fontsize=16,color="black",shape="box"];3398 -> 3456[label="",style="solid", color="black", weight=3];
3399[label="primPlusNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];3399 -> 3457[label="",style="solid", color="black", weight=3];
3538[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (abs (Integer (Pos vuz50))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3538 -> 3546[label="",style="solid", color="black", weight=3];
3539[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3539 -> 3547[label="",style="solid", color="black", weight=3];
3544[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (abs (Integer (Neg vuz64))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3544 -> 3559[label="",style="solid", color="black", weight=3];
3545[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3545 -> 3560[label="",style="solid", color="black", weight=3];
3510[label="vuz300",fontsize=16,color="green",shape="box"];3511[label="vuz300",fontsize=16,color="green",shape="box"];3452[label="vuz300",fontsize=16,color="green",shape="box"];3453[label="vuz300",fontsize=16,color="green",shape="box"];3454[label="Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))) `quot` gcd0 (Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3454 -> 3514[label="",style="solid", color="black", weight=3];
3455[label="Integer (Pos (Succ Zero)) `quot` gcd0 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3455 -> 3515[label="",style="solid", color="black", weight=3];
3158[label="Integer (Pos Zero) `quot` gcd1 False (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3158 -> 3178[label="",style="solid", color="black", weight=3];
3512[label="Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero)))) `quot` gcd0 (Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3512 -> 3522[label="",style="solid", color="black", weight=3];
3513[label="Integer (Neg (Succ Zero)) `quot` gcd0 (Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3513 -> 3523[label="",style="solid", color="black", weight=3];
3163[label="Integer (Neg Zero) `quot` gcd1 False (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3163 -> 3183[label="",style="solid", color="black", weight=3];
3456[label="Succ (Succ (primPlusNat vuz490 Zero))",fontsize=16,color="green",shape="box"];3456 -> 3516[label="",style="dashed", color="green", weight=3];
3457[label="Succ Zero",fontsize=16,color="green",shape="box"];3546[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3546 -> 3561[label="",style="solid", color="black", weight=3];
3547[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 False (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3547 -> 3562[label="",style="solid", color="black", weight=3];
3559[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3559 -> 3570[label="",style="solid", color="black", weight=3];
3560[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 False (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3560 -> 3571[label="",style="solid", color="black", weight=3];
3514[label="Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))) `quot` gcd0Gcd' (abs (Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3514 -> 3524[label="",style="solid", color="black", weight=3];
3515[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd' (abs (Integer (Pos (Succ Zero)))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3515 -> 3525[label="",style="solid", color="black", weight=3];
3178[label="Integer (Pos Zero) `quot` gcd0 (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3178 -> 3199[label="",style="solid", color="black", weight=3];
3522 -> 3533[label="",style="dashed", color="red", weight=0];
3522[label="Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero)))) `quot` gcd0Gcd' (abs (Integer (Neg (Succ (Succ (primPlusNat vuz470 Zero)))))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="magenta"];3522 -> 3534[label="",style="dashed", color="magenta", weight=3];
3522 -> 3535[label="",style="dashed", color="magenta", weight=3];
3523[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd' (abs (Integer (Neg (Succ Zero)))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3523 -> 3540[label="",style="solid", color="black", weight=3];
3183[label="Integer (Neg Zero) `quot` gcd0 (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3183 -> 3205[label="",style="solid", color="black", weight=3];
3516[label="primPlusNat vuz490 Zero",fontsize=16,color="burlywood",shape="triangle"];5543[label="vuz490/Succ vuz4900",fontsize=10,color="white",style="solid",shape="box"];3516 -> 5543[label="",style="solid", color="burlywood", weight=9];
5543 -> 3526[label="",style="solid", color="burlywood", weight=3];
5544[label="vuz490/Zero",fontsize=10,color="white",style="solid",shape="box"];3516 -> 5544[label="",style="solid", color="burlywood", weight=9];
5544 -> 3527[label="",style="solid", color="burlywood", weight=3];
3561[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3561 -> 3572[label="",style="solid", color="black", weight=3];
3562 -> 3520[label="",style="dashed", color="red", weight=0];
3562[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Pos vuz50)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3570[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3570 -> 3576[label="",style="solid", color="black", weight=3];
3571 -> 3529[label="",style="dashed", color="red", weight=0];
3571[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];3524 -> 3541[label="",style="dashed", color="red", weight=0];
3524[label="Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))) `quot` gcd0Gcd'2 (abs (Integer (Pos (Succ (Succ (primPlusNat vuz410 Zero)))))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="magenta"];3524 -> 3542[label="",style="dashed", color="magenta", weight=3];
3524 -> 3543[label="",style="dashed", color="magenta", weight=3];
3525[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'2 (abs (Integer (Pos (Succ Zero)))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3525 -> 3548[label="",style="solid", color="black", weight=3];
3199[label="Integer (Pos Zero) `quot` gcd0Gcd' (abs (Integer (Pos Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3199 -> 3223[label="",style="solid", color="black", weight=3];
3534 -> 3516[label="",style="dashed", color="red", weight=0];
3534[label="primPlusNat vuz470 Zero",fontsize=16,color="magenta"];3534 -> 3549[label="",style="dashed", color="magenta", weight=3];
3535 -> 3516[label="",style="dashed", color="red", weight=0];
3535[label="primPlusNat vuz470 Zero",fontsize=16,color="magenta"];3535 -> 3550[label="",style="dashed", color="magenta", weight=3];
3533[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd' (abs (Integer (Neg (Succ (Succ vuz79))))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="triangle"];3533 -> 3551[label="",style="solid", color="black", weight=3];
3540[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'2 (abs (Integer (Neg (Succ Zero)))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3540 -> 3552[label="",style="solid", color="black", weight=3];
3205[label="Integer (Neg Zero) `quot` gcd0Gcd' (abs (Integer (Neg Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3205 -> 3229[label="",style="solid", color="black", weight=3];
3526[label="primPlusNat (Succ vuz4900) Zero",fontsize=16,color="black",shape="box"];3526 -> 3553[label="",style="solid", color="black", weight=3];
3527[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];3527 -> 3554[label="",style="solid", color="black", weight=3];
3572[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3572 -> 3577[label="",style="solid", color="black", weight=3];
3576[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3576 -> 3581[label="",style="solid", color="black", weight=3];
3542 -> 3516[label="",style="dashed", color="red", weight=0];
3542[label="primPlusNat vuz410 Zero",fontsize=16,color="magenta"];3542 -> 3555[label="",style="dashed", color="magenta", weight=3];
3543 -> 3516[label="",style="dashed", color="red", weight=0];
3543[label="primPlusNat vuz410 Zero",fontsize=16,color="magenta"];3543 -> 3556[label="",style="dashed", color="magenta", weight=3];
3541[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'2 (abs (Integer (Pos (Succ (Succ vuz81))))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="triangle"];3541 -> 3557[label="",style="solid", color="black", weight=3];
3548 -> 3297[label="",style="dashed", color="red", weight=0];
3548[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz42))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="magenta"];3548 -> 3563[label="",style="dashed", color="magenta", weight=3];
3548 -> 3564[label="",style="dashed", color="magenta", weight=3];
3223[label="Integer (Pos Zero) `quot` gcd0Gcd'2 (abs (Integer (Pos Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3223 -> 3248[label="",style="solid", color="black", weight=3];
3549[label="vuz470",fontsize=16,color="green",shape="box"];3550[label="vuz470",fontsize=16,color="green",shape="box"];3551[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'2 (abs (Integer (Neg (Succ (Succ vuz79))))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3551 -> 3565[label="",style="solid", color="black", weight=3];
3552 -> 3297[label="",style="dashed", color="red", weight=0];
3552[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz48))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="magenta"];3552 -> 3566[label="",style="dashed", color="magenta", weight=3];
3552 -> 3567[label="",style="dashed", color="magenta", weight=3];
3229[label="Integer (Neg Zero) `quot` gcd0Gcd'2 (abs (Integer (Neg Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3229 -> 3255[label="",style="solid", color="black", weight=3];
3553[label="Succ vuz4900",fontsize=16,color="green",shape="box"];3554[label="Zero",fontsize=16,color="green",shape="box"];3577[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];3577 -> 3582[label="",style="solid", color="black", weight=3];
3581[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];3581 -> 3586[label="",style="solid", color="black", weight=3];
3555[label="vuz410",fontsize=16,color="green",shape="box"];3556[label="vuz410",fontsize=16,color="green",shape="box"];3557[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz42))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (abs (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3557 -> 3568[label="",style="solid", color="black", weight=3];
3563[label="vuz42",fontsize=16,color="green",shape="box"];3564[label="Integer (Pos (Succ Zero))",fontsize=16,color="green",shape="box"];3297[label="vuz38 `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz39))) == fromInt (Pos Zero)) (abs vuz38) (abs (Integer (Pos (Succ vuz39))))",fontsize=16,color="burlywood",shape="triangle"];5554[label="vuz38/Integer vuz380",fontsize=10,color="white",style="solid",shape="box"];3297 -> 5554[label="",style="solid", color="burlywood", weight=9];
5554 -> 3306[label="",style="solid", color="burlywood", weight=3];
3248 -> 3297[label="",style="dashed", color="red", weight=0];
3248[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];3248 -> 3302[label="",style="dashed", color="magenta", weight=3];
3248 -> 3303[label="",style="dashed", color="magenta", weight=3];
3565[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz48))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (abs (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3565 -> 3573[label="",style="solid", color="black", weight=3];
3566[label="vuz48",fontsize=16,color="green",shape="box"];3567[label="Integer (Neg (Succ Zero))",fontsize=16,color="green",shape="box"];3255 -> 3297[label="",style="dashed", color="red", weight=0];
3255[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];3255 -> 3304[label="",style="dashed", color="magenta", weight=3];
3255 -> 3305[label="",style="dashed", color="magenta", weight=3];
3582[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];3582 -> 3587[label="",style="solid", color="black", weight=3];
3586[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];3586 -> 3591[label="",style="solid", color="black", weight=3];
3568[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz42))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3568 -> 3574[label="",style="solid", color="black", weight=3];
3306[label="Integer vuz380 `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz39))) == fromInt (Pos Zero)) (abs (Integer vuz380)) (abs (Integer (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3306 -> 3517[label="",style="solid", color="black", weight=3];
3302[label="vuz3100",fontsize=16,color="green",shape="box"];3303[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];3573[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz48))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3573 -> 3578[label="",style="solid", color="black", weight=3];
3304[label="vuz3100",fontsize=16,color="green",shape="box"];3305[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];3587[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3587 -> 3592[label="",style="solid", color="black", weight=3];
3591[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3591 -> 3596[label="",style="solid", color="black", weight=3];
3574[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz42))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal2 (Integer (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3574 -> 3579[label="",style="solid", color="black", weight=3];
3517[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz39))) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal (Integer (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3517 -> 3528[label="",style="solid", color="black", weight=3];
3578[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz48))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal2 (Integer (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3578 -> 3583[label="",style="solid", color="black", weight=3];
3592[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3592 -> 3597[label="",style="solid", color="black", weight=3];
3596[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3596 -> 3601[label="",style="solid", color="black", weight=3];
3579[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (Integer (Pos (Succ vuz42)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (Integer (Pos (Succ vuz42)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];3579 -> 3584[label="",style="solid", color="black", weight=3];
3528[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz39))) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal2 (Integer (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3528 -> 3558[label="",style="solid", color="black", weight=3];
3583[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (Integer (Pos (Succ vuz48)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (Integer (Pos (Succ vuz48)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];3583 -> 3588[label="",style="solid", color="black", weight=3];
3597[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];3597 -> 3602[label="",style="solid", color="black", weight=3];
3601[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];3601 -> 3606[label="",style="solid", color="black", weight=3];
3584[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (compare (Integer (Pos (Succ vuz42))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (compare (Integer (Pos (Succ vuz42))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];3584 -> 3589[label="",style="solid", color="black", weight=3];
3558[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (Integer (Pos (Succ vuz39)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (Integer (Pos (Succ vuz39)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];3558 -> 3569[label="",style="solid", color="black", weight=3];
3588[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (compare (Integer (Pos (Succ vuz48))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (compare (Integer (Pos (Succ vuz48))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];3588 -> 3593[label="",style="solid", color="black", weight=3];
3602[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];3602 -> 3607[label="",style="solid", color="black", weight=3];
3606[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];3606 -> 3611[label="",style="solid", color="black", weight=3];
3589[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (not (compare (Integer (Pos (Succ vuz42))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (not (compare (Integer (Pos (Succ vuz42))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3589 -> 3594[label="",style="solid", color="black", weight=3];
3569[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (compare (Integer (Pos (Succ vuz39))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (compare (Integer (Pos (Succ vuz39))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];3569 -> 3575[label="",style="solid", color="black", weight=3];
3593[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (not (compare (Integer (Pos (Succ vuz48))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (not (compare (Integer (Pos (Succ vuz48))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3593 -> 3598[label="",style="solid", color="black", weight=3];
3607[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];3607 -> 3612[label="",style="solid", color="black", weight=3];
3611[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];3611 -> 3616[label="",style="solid", color="black", weight=3];
3594[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (not (compare (Integer (Pos (Succ vuz42))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (not (compare (Integer (Pos (Succ vuz42))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3594 -> 3599[label="",style="solid", color="black", weight=3];
3575[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (not (compare (Integer (Pos (Succ vuz39))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (not (compare (Integer (Pos (Succ vuz39))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3575 -> 3580[label="",style="solid", color="black", weight=3];
3598[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (not (compare (Integer (Pos (Succ vuz48))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (not (compare (Integer (Pos (Succ vuz48))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3598 -> 3603[label="",style="solid", color="black", weight=3];
3612[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];3612 -> 3617[label="",style="solid", color="black", weight=3];
3616[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];3616 -> 3621[label="",style="solid", color="black", weight=3];
3599[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (not (primCmpInt (Pos (Succ vuz42)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (not (primCmpInt (Pos (Succ vuz42)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];3599 -> 3604[label="",style="solid", color="black", weight=3];
3580[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (not (compare (Integer (Pos (Succ vuz39))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (not (compare (Integer (Pos (Succ vuz39))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];3580 -> 3585[label="",style="solid", color="black", weight=3];
3603[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (not (primCmpInt (Pos (Succ vuz48)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (not (primCmpInt (Pos (Succ vuz48)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];3603 -> 3608[label="",style="solid", color="black", weight=3];
3617[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];3617 -> 3622[label="",style="solid", color="black", weight=3];
3621[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];3621 -> 3626[label="",style="solid", color="black", weight=3];
3604[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (not (primCmpNat (Succ vuz42) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (not (primCmpNat (Succ vuz42) Zero == LT)))",fontsize=16,color="black",shape="box"];3604 -> 3609[label="",style="solid", color="black", weight=3];
3585[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (not (primCmpInt (Pos (Succ vuz39)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (not (primCmpInt (Pos (Succ vuz39)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];3585 -> 3590[label="",style="solid", color="black", weight=3];
3608[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (not (primCmpNat (Succ vuz48) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (not (primCmpNat (Succ vuz48) Zero == LT)))",fontsize=16,color="black",shape="box"];3608 -> 3613[label="",style="solid", color="black", weight=3];
3622[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz50))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3622 -> 3627[label="",style="solid", color="black", weight=3];
3626[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3626 -> 3631[label="",style="solid", color="black", weight=3];
3609[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];3609 -> 3614[label="",style="solid", color="black", weight=3];
3590[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (not (primCmpNat (Succ vuz39) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (not (primCmpNat (Succ vuz39) Zero == LT)))",fontsize=16,color="black",shape="box"];3590 -> 3595[label="",style="solid", color="black", weight=3];
3613[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];3613 -> 3618[label="",style="solid", color="black", weight=3];
3627[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Pos vuz50))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3627 -> 3632[label="",style="solid", color="black", weight=3];
3631[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3631 -> 3636[label="",style="solid", color="black", weight=3];
3614[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) (not False))",fontsize=16,color="black",shape="box"];3614 -> 3619[label="",style="solid", color="black", weight=3];
3595[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];3595 -> 3600[label="",style="solid", color="black", weight=3];
3618[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) (not False))",fontsize=16,color="black",shape="box"];3618 -> 3623[label="",style="solid", color="black", weight=3];
3632[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Pos vuz50))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3632 -> 3637[label="",style="solid", color="black", weight=3];
3636[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3636 -> 3641[label="",style="solid", color="black", weight=3];
3619[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz42))) True == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (absReal1 (Integer (Pos (Succ vuz42))) True)",fontsize=16,color="black",shape="box"];3619 -> 3624[label="",style="solid", color="black", weight=3];
3600[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) (not False) == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) (not False))",fontsize=16,color="black",shape="box"];3600 -> 3605[label="",style="solid", color="black", weight=3];
3623[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz48))) True == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (absReal1 (Integer (Pos (Succ vuz48))) True)",fontsize=16,color="black",shape="box"];3623 -> 3628[label="",style="solid", color="black", weight=3];
3637[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 False (abs (Integer (Pos vuz50))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3637 -> 3642[label="",style="solid", color="black", weight=3];
3641[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 False (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3641 -> 3646[label="",style="solid", color="black", weight=3];
3624[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3624 -> 3629[label="",style="solid", color="black", weight=3];
3605[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz39))) True == fromInt (Pos Zero)) (abs (Integer vuz380)) (absReal1 (Integer (Pos (Succ vuz39))) True)",fontsize=16,color="black",shape="box"];3605 -> 3610[label="",style="solid", color="black", weight=3];
3628[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3628 -> 3633[label="",style="solid", color="black", weight=3];
3642[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'0 (abs (Integer (Pos vuz50))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3642 -> 3647[label="",style="solid", color="black", weight=3];
3646[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'0 (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3646 -> 3651[label="",style="solid", color="black", weight=3];
3629[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz42)) == Integer (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3629 -> 3634[label="",style="solid", color="black", weight=3];
3610[label="Integer vuz380 `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (abs (Integer vuz380)) (Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3610 -> 3615[label="",style="solid", color="black", weight=3];
3633[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz48)) == Integer (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3633 -> 3638[label="",style="solid", color="black", weight=3];
3647[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3647 -> 3652[label="",style="solid", color="black", weight=3];
3651[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3651 -> 3656[label="",style="solid", color="black", weight=3];
3634[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz42)) (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz81))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3634 -> 3639[label="",style="solid", color="black", weight=3];
3615[label="Integer vuz380 `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz39)) == Integer (Pos Zero)) (abs (Integer vuz380)) (Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3615 -> 3620[label="",style="solid", color="black", weight=3];
3638[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz48)) (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz79))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3638 -> 3643[label="",style="solid", color="black", weight=3];
3652[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3652 -> 3657[label="",style="solid", color="black", weight=3];
3656[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3656 -> 3661[label="",style="solid", color="black", weight=3];
3639[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 False (abs (Integer (Pos (Succ (Succ vuz81))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3639 -> 3644[label="",style="solid", color="black", weight=3];
3620[label="Integer vuz380 `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz39)) (Pos Zero)) (abs (Integer vuz380)) (Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3620 -> 3625[label="",style="solid", color="black", weight=3];
3643[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 False (abs (Integer (Neg (Succ (Succ vuz79))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3643 -> 3648[label="",style="solid", color="black", weight=3];
3657[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3657 -> 3662[label="",style="solid", color="black", weight=3];
3661[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3661 -> 3666[label="",style="solid", color="black", weight=3];
3644[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'0 (abs (Integer (Pos (Succ (Succ vuz81))))) (Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3644 -> 3649[label="",style="solid", color="black", weight=3];
3625[label="Integer vuz380 `quot` gcd0Gcd'1 False (abs (Integer vuz380)) (Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3625 -> 3630[label="",style="solid", color="black", weight=3];
3648[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'0 (abs (Integer (Neg (Succ (Succ vuz79))))) (Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3648 -> 3653[label="",style="solid", color="black", weight=3];
3662[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3662 -> 3667[label="",style="solid", color="black", weight=3];
3666[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3666 -> 3671[label="",style="solid", color="black", weight=3];
3649[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd' (Integer (Pos (Succ vuz42))) (abs (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3649 -> 3654[label="",style="solid", color="black", weight=3];
3630[label="Integer vuz380 `quot` gcd0Gcd'0 (abs (Integer vuz380)) (Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3630 -> 3635[label="",style="solid", color="black", weight=3];
3653[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd' (Integer (Pos (Succ vuz48))) (abs (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3653 -> 3658[label="",style="solid", color="black", weight=3];
3667[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Pos vuz50)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3667 -> 3672[label="",style="solid", color="black", weight=3];
3671[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3671 -> 3676[label="",style="solid", color="black", weight=3];
3654[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz42))) (abs (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3654 -> 3659[label="",style="solid", color="black", weight=3];
3635[label="Integer vuz380 `quot` gcd0Gcd' (Integer (Pos (Succ vuz39))) (abs (Integer vuz380) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3635 -> 3640[label="",style="solid", color="black", weight=3];
3658[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz48))) (abs (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3658 -> 3663[label="",style="solid", color="black", weight=3];
3672[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz50)) (Integer (Pos vuz50) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz50)) (Integer (Pos vuz50) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3672 -> 3677[label="",style="solid", color="black", weight=3];
3676[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (Integer (Neg vuz64) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (Integer (Neg vuz64) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3676 -> 3681[label="",style="solid", color="black", weight=3];
3659[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (abs (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3659 -> 3664[label="",style="solid", color="black", weight=3];
3640[label="Integer vuz380 `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz39))) (abs (Integer vuz380) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3640 -> 3645[label="",style="solid", color="black", weight=3];
3663[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (abs (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (abs (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3663 -> 3668[label="",style="solid", color="black", weight=3];
3677[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz50)) (compare (Integer (Pos vuz50)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz50)) (compare (Integer (Pos vuz50)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3677 -> 3682[label="",style="solid", color="black", weight=3];
3681[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3681 -> 3687[label="",style="solid", color="black", weight=3];
3664[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3664 -> 3669[label="",style="solid", color="black", weight=3];
3645[label="Integer vuz380 `quot` gcd0Gcd'1 (abs (Integer vuz380) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (abs (Integer vuz380) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3645 -> 3650[label="",style="solid", color="black", weight=3];
3668[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3668 -> 3673[label="",style="solid", color="black", weight=3];
3682[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz50)) (not (compare (Integer (Pos vuz50)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz50)) (not (compare (Integer (Pos vuz50)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3682 -> 3688[label="",style="solid", color="black", weight=3];
3687[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3687 -> 3695[label="",style="solid", color="black", weight=3];
3669[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal2 (Integer (Pos (Succ (Succ vuz81)))) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3669 -> 3674[label="",style="solid", color="black", weight=3];
3650[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal (Integer vuz380) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal (Integer vuz380) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3650 -> 3655[label="",style="solid", color="black", weight=3];
3673[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal2 (Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3673 -> 3678[label="",style="solid", color="black", weight=3];
3688[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz50)) (not (compare (Integer (Pos vuz50)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz50)) (not (compare (Integer (Pos vuz50)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3688 -> 3696[label="",style="solid", color="black", weight=3];
3695[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3695 -> 3703[label="",style="solid", color="black", weight=3];
3674[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (Integer (Pos (Succ (Succ vuz81))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (Integer (Pos (Succ (Succ vuz81))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3674 -> 3679[label="",style="solid", color="black", weight=3];
3655[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal2 (Integer vuz380) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal2 (Integer vuz380) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3655 -> 3660[label="",style="solid", color="black", weight=3];
3678[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (Integer (Neg (Succ (Succ vuz79))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (Integer (Neg (Succ (Succ vuz79))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3678 -> 3683[label="",style="solid", color="black", weight=3];
3696[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz50)) (not (primCmpInt (Pos vuz50) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz50)) (not (primCmpInt (Pos vuz50) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];5557[label="vuz50/Succ vuz500",fontsize=10,color="white",style="solid",shape="box"];3696 -> 5557[label="",style="solid", color="burlywood", weight=9];
5557 -> 3704[label="",style="solid", color="burlywood", weight=3];
5558[label="vuz50/Zero",fontsize=10,color="white",style="solid",shape="box"];3696 -> 5558[label="",style="solid", color="burlywood", weight=9];
5558 -> 3705[label="",style="solid", color="burlywood", weight=3];
3703[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (not (primCmpInt (Neg vuz64) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (not (primCmpInt (Neg vuz64) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];5559[label="vuz64/Succ vuz640",fontsize=10,color="white",style="solid",shape="box"];3703 -> 5559[label="",style="solid", color="burlywood", weight=9];
5559 -> 3712[label="",style="solid", color="burlywood", weight=3];
5560[label="vuz64/Zero",fontsize=10,color="white",style="solid",shape="box"];3703 -> 5560[label="",style="solid", color="burlywood", weight=9];
5560 -> 3713[label="",style="solid", color="burlywood", weight=3];
3679[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (compare (Integer (Pos (Succ (Succ vuz81)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (compare (Integer (Pos (Succ (Succ vuz81)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3679 -> 3684[label="",style="solid", color="black", weight=3];
3660[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer vuz380) (Integer vuz380 >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer vuz380) (Integer vuz380 >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3660 -> 3665[label="",style="solid", color="black", weight=3];
3683[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (compare (Integer (Neg (Succ (Succ vuz79)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (compare (Integer (Neg (Succ (Succ vuz79)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3683 -> 3689[label="",style="solid", color="black", weight=3];
3704[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz500))) (not (primCmpInt (Pos (Succ vuz500)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz500))) (not (primCmpInt (Pos (Succ vuz500)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3704 -> 3714[label="",style="solid", color="black", weight=3];
3705[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3705 -> 3715[label="",style="solid", color="black", weight=3];
3712[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) (not (primCmpInt (Neg (Succ vuz640)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) (not (primCmpInt (Neg (Succ vuz640)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3712 -> 3722[label="",style="solid", color="black", weight=3];
3713[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3713 -> 3723[label="",style="solid", color="black", weight=3];
3684[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (compare (Integer (Pos (Succ (Succ vuz81)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (compare (Integer (Pos (Succ (Succ vuz81)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3684 -> 3690[label="",style="solid", color="black", weight=3];
3665[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer vuz380) (compare (Integer vuz380) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer vuz380) (compare (Integer vuz380) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3665 -> 3670[label="",style="solid", color="black", weight=3];
3689[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (compare (Integer (Neg (Succ (Succ vuz79)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (compare (Integer (Neg (Succ (Succ vuz79)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3689 -> 3697[label="",style="solid", color="black", weight=3];
3714[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz500))) (not (primCmpNat (Succ vuz500) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz500))) (not (primCmpNat (Succ vuz500) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3714 -> 3724[label="",style="solid", color="black", weight=3];
3715[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3715 -> 3725[label="",style="solid", color="black", weight=3];
3722[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3722 -> 3732[label="",style="solid", color="black", weight=3];
3723[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3723 -> 3733[label="",style="solid", color="black", weight=3];
3690[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (compare (Integer (Pos (Succ (Succ vuz81)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (compare (Integer (Pos (Succ (Succ vuz81)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3690 -> 3698[label="",style="solid", color="black", weight=3];
3670[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer vuz380) (not (compare (Integer vuz380) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer vuz380) (not (compare (Integer vuz380) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3670 -> 3675[label="",style="solid", color="black", weight=3];
3697[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (compare (Integer (Neg (Succ (Succ vuz79)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (compare (Integer (Neg (Succ (Succ vuz79)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3697 -> 3706[label="",style="solid", color="black", weight=3];
3724[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz500))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz500))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3724 -> 3734[label="",style="solid", color="black", weight=3];
3725[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3725 -> 3735[label="",style="solid", color="black", weight=3];
3732[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) (not True) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) (not True) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3732 -> 3742[label="",style="solid", color="black", weight=3];
3733[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3733 -> 3743[label="",style="solid", color="black", weight=3];
3698[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (primCmpInt (Pos (Succ (Succ vuz81))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (primCmpInt (Pos (Succ (Succ vuz81))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3698 -> 3707[label="",style="solid", color="black", weight=3];
3675[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer vuz380) (not (compare (Integer vuz380) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer vuz380) (not (compare (Integer vuz380) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3675 -> 3680[label="",style="solid", color="black", weight=3];
3706[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (primCmpInt (Neg (Succ (Succ vuz79))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (primCmpInt (Neg (Succ (Succ vuz79))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3706 -> 3716[label="",style="solid", color="black", weight=3];
3734[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz500))) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz500))) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3734 -> 3744[label="",style="solid", color="black", weight=3];
3735[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3735 -> 3745[label="",style="solid", color="black", weight=3];
3742[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) False `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) False `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3742 -> 3752[label="",style="solid", color="black", weight=3];
3743[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3743 -> 3753[label="",style="solid", color="black", weight=3];
3707[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (primCmpNat (Succ (Succ vuz81)) Zero == LT)) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (primCmpNat (Succ (Succ vuz81)) Zero == LT)) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3707 -> 3717[label="",style="solid", color="black", weight=3];
3680[label="Integer vuz380 `quot` gcd0Gcd'1 (absReal1 (Integer vuz380) (not (primCmpInt vuz380 (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer vuz380) (not (primCmpInt vuz380 (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="burlywood",shape="box"];5561[label="vuz380/Pos vuz3800",fontsize=10,color="white",style="solid",shape="box"];3680 -> 5561[label="",style="solid", color="burlywood", weight=9];
5561 -> 3685[label="",style="solid", color="burlywood", weight=3];
5562[label="vuz380/Neg vuz3800",fontsize=10,color="white",style="solid",shape="box"];3680 -> 5562[label="",style="solid", color="burlywood", weight=9];
5562 -> 3686[label="",style="solid", color="burlywood", weight=3];
3716[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3716 -> 3726[label="",style="solid", color="black", weight=3];
3744[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz500))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz500))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3744 -> 3754[label="",style="solid", color="black", weight=3];
3745[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3745 -> 3755[label="",style="solid", color="black", weight=3];
3752[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz640))) otherwise `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz640))) otherwise `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3752 -> 3762[label="",style="solid", color="black", weight=3];
3753[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3753 -> 3763[label="",style="solid", color="black", weight=3];
3717[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3717 -> 3727[label="",style="solid", color="black", weight=3];
3685[label="Integer (Pos vuz3800) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz3800)) (not (primCmpInt (Pos vuz3800) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos vuz3800)) (not (primCmpInt (Pos vuz3800) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="burlywood",shape="box"];5563[label="vuz3800/Succ vuz38000",fontsize=10,color="white",style="solid",shape="box"];3685 -> 5563[label="",style="solid", color="burlywood", weight=9];
5563 -> 3691[label="",style="solid", color="burlywood", weight=3];
5564[label="vuz3800/Zero",fontsize=10,color="white",style="solid",shape="box"];3685 -> 5564[label="",style="solid", color="burlywood", weight=9];
5564 -> 3692[label="",style="solid", color="burlywood", weight=3];
3686[label="Integer (Neg vuz3800) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz3800)) (not (primCmpInt (Neg vuz3800) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg vuz3800)) (not (primCmpInt (Neg vuz3800) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="burlywood",shape="box"];5565[label="vuz3800/Succ vuz38000",fontsize=10,color="white",style="solid",shape="box"];3686 -> 5565[label="",style="solid", color="burlywood", weight=9];
5565 -> 3693[label="",style="solid", color="burlywood", weight=3];
5566[label="vuz3800/Zero",fontsize=10,color="white",style="solid",shape="box"];3686 -> 5566[label="",style="solid", color="burlywood", weight=9];
5566 -> 3694[label="",style="solid", color="burlywood", weight=3];
3726[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not True) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) (not True) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3726 -> 3736[label="",style="solid", color="black", weight=3];
3754[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz500)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz500)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];3754 -> 3764[label="",style="solid", color="black", weight=3];
3755[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3755 -> 3765[label="",style="solid", color="black", weight=3];
3762[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz640))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz640))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3762 -> 3772[label="",style="solid", color="black", weight=3];
3763[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3763 -> 3773[label="",style="solid", color="black", weight=3];
3727[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not False) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) (not False) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3727 -> 3737[label="",style="solid", color="black", weight=3];
3691[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz38000))) (not (primCmpInt (Pos (Succ vuz38000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos (Succ vuz38000))) (not (primCmpInt (Pos (Succ vuz38000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3691 -> 3699[label="",style="solid", color="black", weight=3];
3692[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3692 -> 3700[label="",style="solid", color="black", weight=3];
3693[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz38000))) (not (primCmpInt (Neg (Succ vuz38000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg (Succ vuz38000))) (not (primCmpInt (Neg (Succ vuz38000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3693 -> 3701[label="",style="solid", color="black", weight=3];
3694[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3694 -> 3702[label="",style="solid", color="black", weight=3];
3736[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz79)))) False `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal1 (Integer (Neg (Succ (Succ vuz79)))) False `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3736 -> 3746[label="",style="solid", color="black", weight=3];
3764[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz500)) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz500)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3764 -> 3774[label="",style="solid", color="black", weight=3];
3765[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3765 -> 3775[label="",style="solid", color="black", weight=3];
3772[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) ((`negate` Integer (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3772 -> 3782[label="",style="solid", color="black", weight=3];
3773[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3773 -> 3783[label="",style="solid", color="black", weight=3];
3737[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz81)))) True `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (absReal1 (Integer (Pos (Succ (Succ vuz81)))) True `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="box"];3737 -> 3747[label="",style="solid", color="black", weight=3];
3699[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz38000))) (not (primCmpNat (Succ vuz38000) Zero == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos (Succ vuz38000))) (not (primCmpNat (Succ vuz38000) Zero == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3699 -> 3708[label="",style="solid", color="black", weight=3];
3700[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3700 -> 3709[label="",style="solid", color="black", weight=3];
3701[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz38000))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg (Succ vuz38000))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3701 -> 3710[label="",style="solid", color="black", weight=3];
3702[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3702 -> 3711[label="",style="solid", color="black", weight=3];
3746[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ (Succ vuz79)))) otherwise `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal0 (Integer (Neg (Succ (Succ vuz79)))) otherwise `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3746 -> 3756[label="",style="solid", color="black", weight=3];
3774[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz500)) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz500)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3774 -> 3784[label="",style="solid", color="black", weight=3];
3775 -> 3769[label="",style="dashed", color="red", weight=0];
3775[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];3775 -> 3785[label="",style="dashed", color="magenta", weight=3];
3775 -> 3786[label="",style="dashed", color="magenta", weight=3];
3782[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primNegInt (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];3782 -> 3793[label="",style="solid", color="black", weight=3];
3783[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3783 -> 3794[label="",style="solid", color="black", weight=3];
3747[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz81))) `rem` Integer (Pos (Succ vuz42)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (Integer (Pos (Succ (Succ vuz81))) `rem` Integer (Pos (Succ vuz42)))",fontsize=16,color="black",shape="triangle"];3747 -> 3757[label="",style="solid", color="black", weight=3];
3708[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz38000))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos (Succ vuz38000))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3708 -> 3718[label="",style="solid", color="black", weight=3];
3709[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3709 -> 3719[label="",style="solid", color="black", weight=3];
3710[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz38000))) (not True) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg (Succ vuz38000))) (not True) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3710 -> 3720[label="",style="solid", color="black", weight=3];
3711[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3711 -> 3721[label="",style="solid", color="black", weight=3];
3756[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ (Succ vuz79)))) True `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (absReal0 (Integer (Neg (Succ (Succ vuz79)))) True `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3756 -> 3766[label="",style="solid", color="black", weight=3];
3784[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz500)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz500)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];3784 -> 3795[label="",style="solid", color="black", weight=3];
3785[label="Integer (Pos (Succ vuz3100))",fontsize=16,color="green",shape="box"];3786[label="vuz3100",fontsize=16,color="green",shape="box"];3769[label="vuz83 `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz84))) (Pos Zero)) (Integer (Pos (Succ vuz84))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz84))))",fontsize=16,color="burlywood",shape="triangle"];5568[label="vuz83/Integer vuz830",fontsize=10,color="white",style="solid",shape="box"];3769 -> 5568[label="",style="solid", color="burlywood", weight=9];
5568 -> 3781[label="",style="solid", color="burlywood", weight=3];
3793[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3793 -> 3803[label="",style="solid", color="black", weight=3];
3794[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3794 -> 3804[label="",style="solid", color="black", weight=3];
3757[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz81))) (Pos (Succ vuz42))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz42))) (Integer (primRemInt (Pos (Succ (Succ vuz81))) (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3757 -> 3767[label="",style="solid", color="black", weight=3];
3718[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz38000))) (not False) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos (Succ vuz38000))) (not False) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3718 -> 3728[label="",style="solid", color="black", weight=3];
3719[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3719 -> 3729[label="",style="solid", color="black", weight=3];
3720[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz38000))) False `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg (Succ vuz38000))) False `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3720 -> 3730[label="",style="solid", color="black", weight=3];
3721[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3721 -> 3731[label="",style="solid", color="black", weight=3];
3766[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) ((`negate` Integer (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3766 -> 3776[label="",style="solid", color="black", weight=3];
3795[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz500) (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS (Succ vuz500) (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];3795 -> 3805[label="",style="solid", color="black", weight=3];
3781[label="Integer vuz830 `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz84))) (Pos Zero)) (Integer (Pos (Succ vuz84))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz84))))",fontsize=16,color="black",shape="box"];3781 -> 3792[label="",style="solid", color="black", weight=3];
3803[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3803 -> 3816[label="",style="solid", color="black", weight=3];
3804[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3804 -> 3817[label="",style="solid", color="black", weight=3];
3767[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz81))) (Pos (Succ vuz42))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz42))) (Integer (primRemInt (Pos (Succ (Succ vuz81))) (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3767 -> 3777[label="",style="solid", color="black", weight=3];
3728[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz38000))) True `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal1 (Integer (Pos (Succ vuz38000))) True `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3728 -> 3738[label="",style="solid", color="black", weight=3];
3729[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3729 -> 3739[label="",style="solid", color="black", weight=3];
3730[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz38000))) otherwise `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal0 (Integer (Neg (Succ vuz38000))) otherwise `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3730 -> 3740[label="",style="solid", color="black", weight=3];
3731[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3731 -> 3741[label="",style="solid", color="black", weight=3];
3776[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (Integer (primNegInt (Neg (Succ (Succ vuz79)))) `rem` Integer (Pos (Succ vuz48)))",fontsize=16,color="black",shape="box"];3776 -> 3787[label="",style="solid", color="black", weight=3];
3805[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz500 vuz3100 (primGEqNatS vuz500 vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS0 vuz500 vuz3100 (primGEqNatS vuz500 vuz3100))))",fontsize=16,color="burlywood",shape="box"];5569[label="vuz500/Succ vuz5000",fontsize=10,color="white",style="solid",shape="box"];3805 -> 5569[label="",style="solid", color="burlywood", weight=9];
5569 -> 3818[label="",style="solid", color="burlywood", weight=3];
5570[label="vuz500/Zero",fontsize=10,color="white",style="solid",shape="box"];3805 -> 5570[label="",style="solid", color="burlywood", weight=9];
5570 -> 3819[label="",style="solid", color="burlywood", weight=3];
3792[label="Integer vuz830 `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz84))) (Pos Zero)) (Integer (Pos (Succ vuz84))) (Integer (Pos (primModNatS Zero (Succ vuz84))))",fontsize=16,color="black",shape="triangle"];3792 -> 3802[label="",style="solid", color="black", weight=3];
3816[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];3816 -> 3830[label="",style="solid", color="black", weight=3];
3817[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3817 -> 3831[label="",style="solid", color="black", weight=3];
3777[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz81))) (Pos (Succ vuz42))) (Pos Zero)) (Integer (Pos (Succ vuz42))) (Integer (primRemInt (Pos (Succ (Succ vuz81))) (Pos (Succ vuz42))))",fontsize=16,color="black",shape="box"];3777 -> 3788[label="",style="solid", color="black", weight=3];
3738[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz38000)) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (Succ vuz38000)) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="triangle"];3738 -> 3748[label="",style="solid", color="black", weight=3];
3739[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz39))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3739 -> 3749[label="",style="solid", color="black", weight=3];
3740[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz38000))) True `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (absReal0 (Integer (Neg (Succ vuz38000))) True `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3740 -> 3750[label="",style="solid", color="black", weight=3];
3741[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz39))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3741 -> 3751[label="",style="solid", color="black", weight=3];
3787[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz79)))) (Pos (Succ vuz48))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz48))) (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz79)))) (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3787 -> 3796[label="",style="solid", color="black", weight=3];
3818[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) vuz3100 (primGEqNatS (Succ vuz5000) vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS0 (Succ vuz5000) vuz3100 (primGEqNatS (Succ vuz5000) vuz3100))))",fontsize=16,color="burlywood",shape="box"];5571[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];3818 -> 5571[label="",style="solid", color="burlywood", weight=9];
5571 -> 3832[label="",style="solid", color="burlywood", weight=3];
5572[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];3818 -> 5572[label="",style="solid", color="burlywood", weight=9];
5572 -> 3833[label="",style="solid", color="burlywood", weight=3];
3819[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz3100 (primGEqNatS Zero vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS0 Zero vuz3100 (primGEqNatS Zero vuz3100))))",fontsize=16,color="burlywood",shape="box"];5573[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];3819 -> 5573[label="",style="solid", color="burlywood", weight=9];
5573 -> 3834[label="",style="solid", color="burlywood", weight=3];
5574[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];3819 -> 5574[label="",style="solid", color="burlywood", weight=9];
5574 -> 3835[label="",style="solid", color="burlywood", weight=3];
3802[label="Integer vuz830 `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz84))) (Integer (Pos Zero))",fontsize=16,color="black",shape="triangle"];3802 -> 3815[label="",style="solid", color="black", weight=3];
3830 -> 3784[label="",style="dashed", color="red", weight=0];
3830[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz640)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz640)) (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];3830 -> 3850[label="",style="dashed", color="magenta", weight=3];
3831 -> 3829[label="",style="dashed", color="red", weight=0];
3831[label="Integer (Pos (Succ vuz3100)) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="magenta"];3831 -> 3851[label="",style="dashed", color="magenta", weight=3];
3831 -> 3852[label="",style="dashed", color="magenta", weight=3];
3788 -> 5084[label="",style="dashed", color="red", weight=0];
3788[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ (Succ vuz81)) (Succ vuz42))) (Pos Zero)) (Integer (Pos (Succ vuz42))) (Integer (Pos (primModNatS (Succ (Succ vuz81)) (Succ vuz42))))",fontsize=16,color="magenta"];3788 -> 5085[label="",style="dashed", color="magenta", weight=3];
3788 -> 5086[label="",style="dashed", color="magenta", weight=3];
3788 -> 5087[label="",style="dashed", color="magenta", weight=3];
3788 -> 5088[label="",style="dashed", color="magenta", weight=3];
3748[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3748 -> 3758[label="",style="solid", color="black", weight=3];
3749[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz39))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3749 -> 3759[label="",style="solid", color="black", weight=3];
3750[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz38000))) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) ((`negate` Integer (Neg (Succ vuz38000))) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3750 -> 3760[label="",style="solid", color="black", weight=3];
3751[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz39))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3751 -> 3761[label="",style="solid", color="black", weight=3];
3796[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz79)))) (Pos (Succ vuz48))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz48))) (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz79)))) (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3796 -> 3806[label="",style="solid", color="black", weight=3];
3832[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) (Succ vuz31000) (primGEqNatS (Succ vuz5000) (Succ vuz31000)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 (Succ vuz5000) (Succ vuz31000) (primGEqNatS (Succ vuz5000) (Succ vuz31000)))))",fontsize=16,color="black",shape="box"];3832 -> 3853[label="",style="solid", color="black", weight=3];
3833[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) Zero (primGEqNatS (Succ vuz5000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz5000) Zero (primGEqNatS (Succ vuz5000) Zero))))",fontsize=16,color="black",shape="box"];3833 -> 3854[label="",style="solid", color="black", weight=3];
3834[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz31000) (primGEqNatS Zero (Succ vuz31000)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 Zero (Succ vuz31000) (primGEqNatS Zero (Succ vuz31000)))))",fontsize=16,color="black",shape="box"];3834 -> 3855[label="",style="solid", color="black", weight=3];
3835[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3835 -> 3856[label="",style="solid", color="black", weight=3];
3815[label="Integer vuz830 `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz84))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3815 -> 3829[label="",style="solid", color="black", weight=3];
3850[label="vuz640",fontsize=16,color="green",shape="box"];3851[label="Pos (Succ vuz3100)",fontsize=16,color="green",shape="box"];3852[label="vuz3100",fontsize=16,color="green",shape="box"];3829[label="Integer vuz830 `quot` Integer (Pos (Succ vuz84))",fontsize=16,color="black",shape="triangle"];3829 -> 3849[label="",style="solid", color="black", weight=3];
5085[label="Succ (Succ vuz81)",fontsize=16,color="green",shape="box"];5086[label="vuz80",fontsize=16,color="green",shape="box"];5087[label="vuz42",fontsize=16,color="green",shape="box"];5088[label="Succ (Succ vuz81)",fontsize=16,color="green",shape="box"];5084[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz153 (Succ vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS vuz152 (Succ vuz143))))",fontsize=16,color="burlywood",shape="triangle"];5578[label="vuz153/Succ vuz1530",fontsize=10,color="white",style="solid",shape="box"];5084 -> 5578[label="",style="solid", color="burlywood", weight=9];
5578 -> 5111[label="",style="solid", color="burlywood", weight=3];
5579[label="vuz153/Zero",fontsize=10,color="white",style="solid",shape="box"];5084 -> 5579[label="",style="solid", color="burlywood", weight=9];
5579 -> 5112[label="",style="solid", color="burlywood", weight=3];
3758[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3758 -> 3768[label="",style="solid", color="black", weight=3];
3759 -> 3769[label="",style="dashed", color="red", weight=0];
3759[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz39))))",fontsize=16,color="magenta"];3759 -> 3770[label="",style="dashed", color="magenta", weight=3];
3759 -> 3771[label="",style="dashed", color="magenta", weight=3];
3760[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz38000))) `rem` Integer (Pos (Succ vuz39)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primNegInt (Neg (Succ vuz38000))) `rem` Integer (Pos (Succ vuz39)))",fontsize=16,color="black",shape="box"];3760 -> 3778[label="",style="solid", color="black", weight=3];
3761[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3761 -> 3779[label="",style="solid", color="black", weight=3];
3806[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ (Succ vuz79)))) (Pos (Succ vuz48))) (Pos Zero)) (Integer (Pos (Succ vuz48))) (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz79)))) (Pos (Succ vuz48))))",fontsize=16,color="black",shape="box"];3806 -> 3820[label="",style="solid", color="black", weight=3];
3853 -> 4915[label="",style="dashed", color="red", weight=0];
3853[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) (Succ vuz31000) (primGEqNatS vuz5000 vuz31000))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 (Succ vuz5000) (Succ vuz31000) (primGEqNatS vuz5000 vuz31000))))",fontsize=16,color="magenta"];3853 -> 4921[label="",style="dashed", color="magenta", weight=3];
3853 -> 4922[label="",style="dashed", color="magenta", weight=3];
3853 -> 4923[label="",style="dashed", color="magenta", weight=3];
3853 -> 4924[label="",style="dashed", color="magenta", weight=3];
3853 -> 4925[label="",style="dashed", color="magenta", weight=3];
3854[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz5000) Zero True)))",fontsize=16,color="black",shape="box"];3854 -> 3872[label="",style="solid", color="black", weight=3];
3855[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz31000) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 Zero (Succ vuz31000) False)))",fontsize=16,color="black",shape="box"];3855 -> 3873[label="",style="solid", color="black", weight=3];
3856 -> 3828[label="",style="dashed", color="red", weight=0];
3856[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];3849[label="Integer (primQuotInt vuz830 (Pos (Succ vuz84)))",fontsize=16,color="green",shape="box"];3849 -> 3868[label="",style="dashed", color="green", weight=3];
5111[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1530) (Succ vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS vuz152 (Succ vuz143))))",fontsize=16,color="black",shape="box"];5111 -> 5146[label="",style="solid", color="black", weight=3];
5112[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS vuz152 (Succ vuz143))))",fontsize=16,color="black",shape="box"];5112 -> 5147[label="",style="solid", color="black", weight=3];
3768[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3768 -> 3780[label="",style="solid", color="black", weight=3];
3770[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];3771[label="vuz39",fontsize=16,color="green",shape="box"];3778[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz38000))) (Pos (Succ vuz39))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (primNegInt (Neg (Succ vuz38000))) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3778 -> 3789[label="",style="solid", color="black", weight=3];
3779[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Neg (primModNatS Zero (Succ vuz39))))",fontsize=16,color="black",shape="box"];3779 -> 3790[label="",style="solid", color="black", weight=3];
3820[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz79))) (Pos (Succ vuz48))) (Pos Zero)) (Integer (Pos (Succ vuz48))) (Integer (primRemInt (Pos (Succ (Succ vuz79))) (Pos (Succ vuz48))))",fontsize=16,color="black",shape="triangle"];3820 -> 3836[label="",style="solid", color="black", weight=3];
4921[label="vuz5000",fontsize=16,color="green",shape="box"];4922[label="vuz31000",fontsize=16,color="green",shape="box"];4923[label="vuz5000",fontsize=16,color="green",shape="box"];4924[label="Succ vuz31000",fontsize=16,color="green",shape="box"];4925[label="vuz31000",fontsize=16,color="green",shape="box"];4915[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS vuz144 vuz145))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS vuz144 vuz145))))",fontsize=16,color="burlywood",shape="triangle"];5583[label="vuz144/Succ vuz1440",fontsize=10,color="white",style="solid",shape="box"];4915 -> 5583[label="",style="solid", color="burlywood", weight=9];
5583 -> 5011[label="",style="solid", color="burlywood", weight=3];
5584[label="vuz144/Zero",fontsize=10,color="white",style="solid",shape="box"];4915 -> 5584[label="",style="solid", color="burlywood", weight=9];
5584 -> 5012[label="",style="solid", color="burlywood", weight=3];
3872[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz5000) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz5000) Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];3872 -> 3891[label="",style="solid", color="black", weight=3];
3873[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3873 -> 3892[label="",style="solid", color="black", weight=3];
3828[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="triangle"];3828 -> 3848[label="",style="solid", color="black", weight=3];
3868[label="primQuotInt vuz830 (Pos (Succ vuz84))",fontsize=16,color="burlywood",shape="box"];5585[label="vuz830/Pos vuz8300",fontsize=10,color="white",style="solid",shape="box"];3868 -> 5585[label="",style="solid", color="burlywood", weight=9];
5585 -> 3889[label="",style="solid", color="burlywood", weight=3];
5586[label="vuz830/Neg vuz8300",fontsize=10,color="white",style="solid",shape="box"];3868 -> 5586[label="",style="solid", color="burlywood", weight=9];
5586 -> 3890[label="",style="solid", color="burlywood", weight=3];
5146[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1530 vuz143 (primGEqNatS vuz1530 vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 vuz1530 vuz143 (primGEqNatS vuz1530 vuz143))))",fontsize=16,color="burlywood",shape="box"];5587[label="vuz1530/Succ vuz15300",fontsize=10,color="white",style="solid",shape="box"];5146 -> 5587[label="",style="solid", color="burlywood", weight=9];
5587 -> 5240[label="",style="solid", color="burlywood", weight=3];
5588[label="vuz1530/Zero",fontsize=10,color="white",style="solid",shape="box"];5146 -> 5588[label="",style="solid", color="burlywood", weight=9];
5588 -> 5241[label="",style="solid", color="burlywood", weight=3];
5147 -> 3802[label="",style="dashed", color="red", weight=0];
5147[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos Zero))",fontsize=16,color="magenta"];5147 -> 5242[label="",style="dashed", color="magenta", weight=3];
5147 -> 5243[label="",style="dashed", color="magenta", weight=3];
3780[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz38000) (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS (Succ vuz38000) (Succ vuz39))))",fontsize=16,color="black",shape="box"];3780 -> 3791[label="",style="solid", color="black", weight=3];
3789[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz38000))) (Pos (Succ vuz39))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (primNegInt (Neg (Succ vuz38000))) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3789 -> 3798[label="",style="solid", color="black", weight=3];
3790[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3790 -> 3799[label="",style="solid", color="black", weight=3];
3836 -> 5304[label="",style="dashed", color="red", weight=0];
3836[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ (Succ vuz79)) (Succ vuz48))) (Pos Zero)) (Integer (Pos (Succ vuz48))) (Integer (Pos (primModNatS (Succ (Succ vuz79)) (Succ vuz48))))",fontsize=16,color="magenta"];3836 -> 5305[label="",style="dashed", color="magenta", weight=3];
3836 -> 5306[label="",style="dashed", color="magenta", weight=3];
3836 -> 5307[label="",style="dashed", color="magenta", weight=3];
3836 -> 5308[label="",style="dashed", color="magenta", weight=3];
5011[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS (Succ vuz1440) vuz145))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS (Succ vuz1440) vuz145))))",fontsize=16,color="burlywood",shape="box"];5591[label="vuz145/Succ vuz1450",fontsize=10,color="white",style="solid",shape="box"];5011 -> 5591[label="",style="solid", color="burlywood", weight=9];
5591 -> 5025[label="",style="solid", color="burlywood", weight=3];
5592[label="vuz145/Zero",fontsize=10,color="white",style="solid",shape="box"];5011 -> 5592[label="",style="solid", color="burlywood", weight=9];
5592 -> 5026[label="",style="solid", color="burlywood", weight=3];
5012[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS Zero vuz145))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS Zero vuz145))))",fontsize=16,color="burlywood",shape="box"];5593[label="vuz145/Succ vuz1450",fontsize=10,color="white",style="solid",shape="box"];5012 -> 5593[label="",style="solid", color="burlywood", weight=9];
5593 -> 5027[label="",style="solid", color="burlywood", weight=3];
5594[label="vuz145/Zero",fontsize=10,color="white",style="solid",shape="box"];5012 -> 5594[label="",style="solid", color="burlywood", weight=9];
5594 -> 5028[label="",style="solid", color="burlywood", weight=3];
3891 -> 3795[label="",style="dashed", color="red", weight=0];
3891[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz5000) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz5000) (Succ Zero))))",fontsize=16,color="magenta"];3891 -> 3910[label="",style="dashed", color="magenta", weight=3];
3891 -> 3911[label="",style="dashed", color="magenta", weight=3];
3892 -> 4313[label="",style="dashed", color="red", weight=0];
3892[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];3892 -> 4314[label="",style="dashed", color="magenta", weight=3];
3892 -> 4315[label="",style="dashed", color="magenta", weight=3];
3848[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];3848 -> 3867[label="",style="solid", color="black", weight=3];
3889[label="primQuotInt (Pos vuz8300) (Pos (Succ vuz84))",fontsize=16,color="black",shape="box"];3889 -> 3908[label="",style="solid", color="black", weight=3];
3890[label="primQuotInt (Neg vuz8300) (Pos (Succ vuz84))",fontsize=16,color="black",shape="box"];3890 -> 3909[label="",style="solid", color="black", weight=3];
5240[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15300) vuz143 (primGEqNatS (Succ vuz15300) vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz15300) vuz143 (primGEqNatS (Succ vuz15300) vuz143))))",fontsize=16,color="burlywood",shape="box"];5597[label="vuz143/Succ vuz1430",fontsize=10,color="white",style="solid",shape="box"];5240 -> 5597[label="",style="solid", color="burlywood", weight=9];
5597 -> 5252[label="",style="solid", color="burlywood", weight=3];
5598[label="vuz143/Zero",fontsize=10,color="white",style="solid",shape="box"];5240 -> 5598[label="",style="solid", color="burlywood", weight=9];
5598 -> 5253[label="",style="solid", color="burlywood", weight=3];
5241[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz143 (primGEqNatS Zero vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 Zero vuz143 (primGEqNatS Zero vuz143))))",fontsize=16,color="burlywood",shape="box"];5599[label="vuz143/Succ vuz1430",fontsize=10,color="white",style="solid",shape="box"];5241 -> 5599[label="",style="solid", color="burlywood", weight=9];
5599 -> 5254[label="",style="solid", color="burlywood", weight=3];
5600[label="vuz143/Zero",fontsize=10,color="white",style="solid",shape="box"];5241 -> 5600[label="",style="solid", color="burlywood", weight=9];
5600 -> 5255[label="",style="solid", color="burlywood", weight=3];
5242[label="Pos (Succ (Succ vuz141))",fontsize=16,color="green",shape="box"];5243[label="vuz143",fontsize=16,color="green",shape="box"];3791[label="Integer (Pos (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz38000 vuz39 (primGEqNatS vuz38000 vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS0 vuz38000 vuz39 (primGEqNatS vuz38000 vuz39))))",fontsize=16,color="burlywood",shape="box"];5601[label="vuz38000/Succ vuz380000",fontsize=10,color="white",style="solid",shape="box"];3791 -> 5601[label="",style="solid", color="burlywood", weight=9];
5601 -> 3800[label="",style="solid", color="burlywood", weight=3];
5602[label="vuz38000/Zero",fontsize=10,color="white",style="solid",shape="box"];3791 -> 5602[label="",style="solid", color="burlywood", weight=9];
5602 -> 3801[label="",style="solid", color="burlywood", weight=3];
3798[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz38000))) (Pos (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (primNegInt (Neg (Succ vuz38000))) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3798 -> 3809[label="",style="solid", color="black", weight=3];
3799[label="Integer (Neg Zero) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz39))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3799 -> 3810[label="",style="solid", color="black", weight=3];
5305[label="Succ (Succ vuz79)",fontsize=16,color="green",shape="box"];5306[label="vuz48",fontsize=16,color="green",shape="box"];5307[label="vuz78",fontsize=16,color="green",shape="box"];5308[label="Succ (Succ vuz79)",fontsize=16,color="green",shape="box"];5304[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz165 (Succ vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS vuz164 (Succ vuz157))))",fontsize=16,color="burlywood",shape="triangle"];5603[label="vuz165/Succ vuz1650",fontsize=10,color="white",style="solid",shape="box"];5304 -> 5603[label="",style="solid", color="burlywood", weight=9];
5603 -> 5327[label="",style="solid", color="burlywood", weight=3];
5604[label="vuz165/Zero",fontsize=10,color="white",style="solid",shape="box"];5304 -> 5604[label="",style="solid", color="burlywood", weight=9];
5604 -> 5328[label="",style="solid", color="burlywood", weight=3];
5025[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS (Succ vuz1440) (Succ vuz1450)))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS (Succ vuz1440) (Succ vuz1450)))))",fontsize=16,color="black",shape="box"];5025 -> 5044[label="",style="solid", color="black", weight=3];
5026[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS (Succ vuz1440) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS (Succ vuz1440) Zero))))",fontsize=16,color="black",shape="box"];5026 -> 5045[label="",style="solid", color="black", weight=3];
5027[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS Zero (Succ vuz1450)))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS Zero (Succ vuz1450)))))",fontsize=16,color="black",shape="box"];5027 -> 5046[label="",style="solid", color="black", weight=3];
5028[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];5028 -> 5047[label="",style="solid", color="black", weight=3];
3910[label="Zero",fontsize=16,color="green",shape="box"];3911[label="vuz5000",fontsize=16,color="green",shape="box"];4314[label="Succ vuz31000",fontsize=16,color="green",shape="box"];4315[label="vuz31000",fontsize=16,color="green",shape="box"];4313[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz98))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="triangle"];4313 -> 4320[label="",style="solid", color="black", weight=3];
3867 -> 3792[label="",style="dashed", color="red", weight=0];
3867[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS Zero (Succ Zero))))",fontsize=16,color="magenta"];3867 -> 3887[label="",style="dashed", color="magenta", weight=3];
3867 -> 3888[label="",style="dashed", color="magenta", weight=3];
3908[label="Pos (primDivNatS vuz8300 (Succ vuz84))",fontsize=16,color="green",shape="box"];3908 -> 3933[label="",style="dashed", color="green", weight=3];
3909[label="Neg (primDivNatS vuz8300 (Succ vuz84))",fontsize=16,color="green",shape="box"];3909 -> 3934[label="",style="dashed", color="green", weight=3];
5252[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15300) (Succ vuz1430) (primGEqNatS (Succ vuz15300) (Succ vuz1430)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1430)))) (Integer (Pos (primModNatS0 (Succ vuz15300) (Succ vuz1430) (primGEqNatS (Succ vuz15300) (Succ vuz1430)))))",fontsize=16,color="black",shape="box"];5252 -> 5263[label="",style="solid", color="black", weight=3];
5253[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15300) Zero (primGEqNatS (Succ vuz15300) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz15300) Zero (primGEqNatS (Succ vuz15300) Zero))))",fontsize=16,color="black",shape="box"];5253 -> 5264[label="",style="solid", color="black", weight=3];
5254[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1430) (primGEqNatS Zero (Succ vuz1430)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1430)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1430) (primGEqNatS Zero (Succ vuz1430)))))",fontsize=16,color="black",shape="box"];5254 -> 5265[label="",style="solid", color="black", weight=3];
5255[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];5255 -> 5266[label="",style="solid", color="black", weight=3];
3800[label="Integer (Pos (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) vuz39 (primGEqNatS (Succ vuz380000) vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS0 (Succ vuz380000) vuz39 (primGEqNatS (Succ vuz380000) vuz39))))",fontsize=16,color="burlywood",shape="box"];5606[label="vuz39/Succ vuz390",fontsize=10,color="white",style="solid",shape="box"];3800 -> 5606[label="",style="solid", color="burlywood", weight=9];
5606 -> 3811[label="",style="solid", color="burlywood", weight=3];
5607[label="vuz39/Zero",fontsize=10,color="white",style="solid",shape="box"];3800 -> 5607[label="",style="solid", color="burlywood", weight=9];
5607 -> 3812[label="",style="solid", color="burlywood", weight=3];
3801[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz39 (primGEqNatS Zero vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS0 Zero vuz39 (primGEqNatS Zero vuz39))))",fontsize=16,color="burlywood",shape="box"];5608[label="vuz39/Succ vuz390",fontsize=10,color="white",style="solid",shape="box"];3801 -> 5608[label="",style="solid", color="burlywood", weight=9];
5608 -> 3813[label="",style="solid", color="burlywood", weight=3];
5609[label="vuz39/Zero",fontsize=10,color="white",style="solid",shape="box"];3801 -> 5609[label="",style="solid", color="burlywood", weight=9];
5609 -> 3814[label="",style="solid", color="burlywood", weight=3];
3809[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (primRemInt (Pos (Succ vuz38000)) (Pos (Succ vuz39))))",fontsize=16,color="black",shape="box"];3809 -> 3823[label="",style="solid", color="black", weight=3];
3810[label="Integer (Neg Zero) `quot` Integer (Pos (Succ vuz39))",fontsize=16,color="black",shape="box"];3810 -> 3824[label="",style="solid", color="black", weight=3];
5327[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1650) (Succ vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS vuz164 (Succ vuz157))))",fontsize=16,color="black",shape="box"];5327 -> 5349[label="",style="solid", color="black", weight=3];
5328[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS vuz164 (Succ vuz157))))",fontsize=16,color="black",shape="box"];5328 -> 5350[label="",style="solid", color="black", weight=3];
5044 -> 4915[label="",style="dashed", color="red", weight=0];
5044[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS vuz1440 vuz1450))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 (primGEqNatS vuz1440 vuz1450))))",fontsize=16,color="magenta"];5044 -> 5050[label="",style="dashed", color="magenta", weight=3];
5044 -> 5051[label="",style="dashed", color="magenta", weight=3];
5045[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 True)) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 True)))",fontsize=16,color="black",shape="triangle"];5045 -> 5052[label="",style="solid", color="black", weight=3];
5046[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 False)) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 False)))",fontsize=16,color="black",shape="box"];5046 -> 5053[label="",style="solid", color="black", weight=3];
5047 -> 5045[label="",style="dashed", color="red", weight=0];
5047[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz142) vuz143 True)) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS0 (Succ vuz142) vuz143 True)))",fontsize=16,color="magenta"];4320[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz98))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];4320 -> 4360[label="",style="solid", color="black", weight=3];
3887[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];3888[label="Zero",fontsize=16,color="green",shape="box"];3933[label="primDivNatS vuz8300 (Succ vuz84)",fontsize=16,color="burlywood",shape="triangle"];5612[label="vuz8300/Succ vuz83000",fontsize=10,color="white",style="solid",shape="box"];3933 -> 5612[label="",style="solid", color="burlywood", weight=9];
5612 -> 3953[label="",style="solid", color="burlywood", weight=3];
5613[label="vuz8300/Zero",fontsize=10,color="white",style="solid",shape="box"];3933 -> 5613[label="",style="solid", color="burlywood", weight=9];
5613 -> 3954[label="",style="solid", color="burlywood", weight=3];
3934 -> 3933[label="",style="dashed", color="red", weight=0];
3934[label="primDivNatS vuz8300 (Succ vuz84)",fontsize=16,color="magenta"];3934 -> 3955[label="",style="dashed", color="magenta", weight=3];
5263 -> 4915[label="",style="dashed", color="red", weight=0];
5263[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15300) (Succ vuz1430) (primGEqNatS vuz15300 vuz1430))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1430)))) (Integer (Pos (primModNatS0 (Succ vuz15300) (Succ vuz1430) (primGEqNatS vuz15300 vuz1430))))",fontsize=16,color="magenta"];5263 -> 5280[label="",style="dashed", color="magenta", weight=3];
5263 -> 5281[label="",style="dashed", color="magenta", weight=3];
5263 -> 5282[label="",style="dashed", color="magenta", weight=3];
5263 -> 5283[label="",style="dashed", color="magenta", weight=3];
5264 -> 5045[label="",style="dashed", color="red", weight=0];
5264[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15300) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz15300) Zero True)))",fontsize=16,color="magenta"];5264 -> 5284[label="",style="dashed", color="magenta", weight=3];
5264 -> 5285[label="",style="dashed", color="magenta", weight=3];
5265[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1430) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1430)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1430) False)))",fontsize=16,color="black",shape="box"];5265 -> 5286[label="",style="solid", color="black", weight=3];
5266[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];5266 -> 5287[label="",style="solid", color="black", weight=3];
3811[label="Integer (Pos (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS (Succ vuz380000) (Succ vuz390)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS (Succ vuz380000) (Succ vuz390)))))",fontsize=16,color="black",shape="box"];3811 -> 3825[label="",style="solid", color="black", weight=3];
3812[label="Integer (Pos (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) Zero (primGEqNatS (Succ vuz380000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz380000) Zero (primGEqNatS (Succ vuz380000) Zero))))",fontsize=16,color="black",shape="box"];3812 -> 3826[label="",style="solid", color="black", weight=3];
3813[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz390) (primGEqNatS Zero (Succ vuz390)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 Zero (Succ vuz390) (primGEqNatS Zero (Succ vuz390)))))",fontsize=16,color="black",shape="box"];3813 -> 3827[label="",style="solid", color="black", weight=3];
3814[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3814 -> 3828[label="",style="solid", color="black", weight=3];
3823[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz38000) (Succ vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS (Succ vuz38000) (Succ vuz39))))",fontsize=16,color="black",shape="box"];3823 -> 3840[label="",style="solid", color="black", weight=3];
3824[label="Integer (primQuotInt (Neg Zero) (Pos (Succ vuz39)))",fontsize=16,color="green",shape="box"];3824 -> 3841[label="",style="dashed", color="green", weight=3];
5349[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1650 vuz157 (primGEqNatS vuz1650 vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 vuz1650 vuz157 (primGEqNatS vuz1650 vuz157))))",fontsize=16,color="burlywood",shape="box"];5617[label="vuz1650/Succ vuz16500",fontsize=10,color="white",style="solid",shape="box"];5349 -> 5617[label="",style="solid", color="burlywood", weight=9];
5617 -> 5356[label="",style="solid", color="burlywood", weight=3];
5618[label="vuz1650/Zero",fontsize=10,color="white",style="solid",shape="box"];5349 -> 5618[label="",style="solid", color="burlywood", weight=9];
5618 -> 5357[label="",style="solid", color="burlywood", weight=3];
5350 -> 3802[label="",style="dashed", color="red", weight=0];
5350[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos Zero))",fontsize=16,color="magenta"];5350 -> 5358[label="",style="dashed", color="magenta", weight=3];
5350 -> 5359[label="",style="dashed", color="magenta", weight=3];
5050[label="vuz1440",fontsize=16,color="green",shape="box"];5051[label="vuz1450",fontsize=16,color="green",shape="box"];5052 -> 5084[label="",style="dashed", color="red", weight=0];
5052[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz142) vuz143) (Succ vuz143))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz142) vuz143) (Succ vuz143))))",fontsize=16,color="magenta"];5052 -> 5089[label="",style="dashed", color="magenta", weight=3];
5052 -> 5090[label="",style="dashed", color="magenta", weight=3];
5053[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz142))) (Pos Zero)) (Integer (Pos (Succ vuz143))) (Integer (Pos (Succ (Succ vuz142))))",fontsize=16,color="black",shape="box"];5053 -> 5113[label="",style="solid", color="black", weight=3];
4360[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz98)) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];4360 -> 4379[label="",style="solid", color="black", weight=3];
3953[label="primDivNatS (Succ vuz83000) (Succ vuz84)",fontsize=16,color="black",shape="box"];3953 -> 3977[label="",style="solid", color="black", weight=3];
3954[label="primDivNatS Zero (Succ vuz84)",fontsize=16,color="black",shape="box"];3954 -> 3978[label="",style="solid", color="black", weight=3];
3955[label="vuz8300",fontsize=16,color="green",shape="box"];5280[label="vuz15300",fontsize=16,color="green",shape="box"];5281[label="vuz15300",fontsize=16,color="green",shape="box"];5282[label="Succ vuz1430",fontsize=16,color="green",shape="box"];5283[label="vuz1430",fontsize=16,color="green",shape="box"];5284[label="vuz15300",fontsize=16,color="green",shape="box"];5285[label="Zero",fontsize=16,color="green",shape="box"];5286[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1430)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5286 -> 5300[label="",style="solid", color="black", weight=3];
5287 -> 5084[label="",style="dashed", color="red", weight=0];
5287[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];5287 -> 5301[label="",style="dashed", color="magenta", weight=3];
5287 -> 5302[label="",style="dashed", color="magenta", weight=3];
5287 -> 5303[label="",style="dashed", color="magenta", weight=3];
3825 -> 4915[label="",style="dashed", color="red", weight=0];
3825[label="Integer (Pos (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS vuz380000 vuz390))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS vuz380000 vuz390))))",fontsize=16,color="magenta"];3825 -> 4936[label="",style="dashed", color="magenta", weight=3];
3825 -> 4937[label="",style="dashed", color="magenta", weight=3];
3825 -> 4938[label="",style="dashed", color="magenta", weight=3];
3825 -> 4939[label="",style="dashed", color="magenta", weight=3];
3825 -> 4940[label="",style="dashed", color="magenta", weight=3];
3826 -> 3822[label="",style="dashed", color="red", weight=0];
3826[label="Integer (Pos (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz380000) Zero True)))",fontsize=16,color="magenta"];3826 -> 3845[label="",style="dashed", color="magenta", weight=3];
3826 -> 3846[label="",style="dashed", color="magenta", weight=3];
3827[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz390) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 Zero (Succ vuz390) False)))",fontsize=16,color="black",shape="box"];3827 -> 3847[label="",style="solid", color="black", weight=3];
3840[label="Integer (Neg (Succ vuz38000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz38000 vuz39 (primGEqNatS vuz38000 vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS0 vuz38000 vuz39 (primGEqNatS vuz38000 vuz39))))",fontsize=16,color="burlywood",shape="box"];5624[label="vuz38000/Succ vuz380000",fontsize=10,color="white",style="solid",shape="box"];3840 -> 5624[label="",style="solid", color="burlywood", weight=9];
5624 -> 3863[label="",style="solid", color="burlywood", weight=3];
5625[label="vuz38000/Zero",fontsize=10,color="white",style="solid",shape="box"];3840 -> 5625[label="",style="solid", color="burlywood", weight=9];
5625 -> 3864[label="",style="solid", color="burlywood", weight=3];
3841[label="primQuotInt (Neg Zero) (Pos (Succ vuz39))",fontsize=16,color="black",shape="box"];3841 -> 3865[label="",style="solid", color="black", weight=3];
5356[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16500) vuz157 (primGEqNatS (Succ vuz16500) vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz16500) vuz157 (primGEqNatS (Succ vuz16500) vuz157))))",fontsize=16,color="burlywood",shape="box"];5626[label="vuz157/Succ vuz1570",fontsize=10,color="white",style="solid",shape="box"];5356 -> 5626[label="",style="solid", color="burlywood", weight=9];
5626 -> 5364[label="",style="solid", color="burlywood", weight=3];
5627[label="vuz157/Zero",fontsize=10,color="white",style="solid",shape="box"];5356 -> 5627[label="",style="solid", color="burlywood", weight=9];
5627 -> 5365[label="",style="solid", color="burlywood", weight=3];
5357[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz157 (primGEqNatS Zero vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 Zero vuz157 (primGEqNatS Zero vuz157))))",fontsize=16,color="burlywood",shape="box"];5628[label="vuz157/Succ vuz1570",fontsize=10,color="white",style="solid",shape="box"];5357 -> 5628[label="",style="solid", color="burlywood", weight=9];
5628 -> 5366[label="",style="solid", color="burlywood", weight=3];
5629[label="vuz157/Zero",fontsize=10,color="white",style="solid",shape="box"];5357 -> 5629[label="",style="solid", color="burlywood", weight=9];
5629 -> 5367[label="",style="solid", color="burlywood", weight=3];
5358[label="Neg (Succ (Succ vuz155))",fontsize=16,color="green",shape="box"];5359[label="vuz157",fontsize=16,color="green",shape="box"];5089 -> 4762[label="",style="dashed", color="red", weight=0];
5089[label="primMinusNatS (Succ vuz142) vuz143",fontsize=16,color="magenta"];5089 -> 5114[label="",style="dashed", color="magenta", weight=3];
5089 -> 5115[label="",style="dashed", color="magenta", weight=3];
5090 -> 4762[label="",style="dashed", color="red", weight=0];
5090[label="primMinusNatS (Succ vuz142) vuz143",fontsize=16,color="magenta"];5090 -> 5116[label="",style="dashed", color="magenta", weight=3];
5090 -> 5117[label="",style="dashed", color="magenta", weight=3];
5113[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz143))) (Integer (Pos (Succ (Succ vuz142))))",fontsize=16,color="black",shape="box"];5113 -> 5148[label="",style="solid", color="black", weight=3];
4379[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz98)) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];4379 -> 4406[label="",style="solid", color="black", weight=3];
3977[label="primDivNatS0 vuz83000 vuz84 (primGEqNatS vuz83000 vuz84)",fontsize=16,color="burlywood",shape="box"];5632[label="vuz83000/Succ vuz830000",fontsize=10,color="white",style="solid",shape="box"];3977 -> 5632[label="",style="solid", color="burlywood", weight=9];
5632 -> 4000[label="",style="solid", color="burlywood", weight=3];
5633[label="vuz83000/Zero",fontsize=10,color="white",style="solid",shape="box"];3977 -> 5633[label="",style="solid", color="burlywood", weight=9];
5633 -> 4001[label="",style="solid", color="burlywood", weight=3];
3978[label="Zero",fontsize=16,color="green",shape="box"];5300 -> 4313[label="",style="dashed", color="red", weight=0];
5300[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1430)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];5300 -> 5329[label="",style="dashed", color="magenta", weight=3];
5300 -> 5330[label="",style="dashed", color="magenta", weight=3];
5301 -> 4762[label="",style="dashed", color="red", weight=0];
5301[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];5301 -> 5331[label="",style="dashed", color="magenta", weight=3];
5301 -> 5332[label="",style="dashed", color="magenta", weight=3];
5302[label="Zero",fontsize=16,color="green",shape="box"];5303 -> 4762[label="",style="dashed", color="red", weight=0];
5303[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];5303 -> 5333[label="",style="dashed", color="magenta", weight=3];
5303 -> 5334[label="",style="dashed", color="magenta", weight=3];
4936[label="vuz380000",fontsize=16,color="green",shape="box"];4937[label="vuz380000",fontsize=16,color="green",shape="box"];4938[label="vuz380000",fontsize=16,color="green",shape="box"];4939[label="Succ vuz390",fontsize=16,color="green",shape="box"];4940[label="vuz390",fontsize=16,color="green",shape="box"];3845[label="vuz380000",fontsize=16,color="green",shape="box"];3846[label="vuz380000",fontsize=16,color="green",shape="box"];3822[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz81) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz81) Zero True)))",fontsize=16,color="black",shape="triangle"];3822 -> 3839[label="",style="solid", color="black", weight=3];
3847[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3847 -> 3866[label="",style="solid", color="black", weight=3];
3863[label="Integer (Neg (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) vuz39 (primGEqNatS (Succ vuz380000) vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS0 (Succ vuz380000) vuz39 (primGEqNatS (Succ vuz380000) vuz39))))",fontsize=16,color="burlywood",shape="box"];5637[label="vuz39/Succ vuz390",fontsize=10,color="white",style="solid",shape="box"];3863 -> 5637[label="",style="solid", color="burlywood", weight=9];
5637 -> 3881[label="",style="solid", color="burlywood", weight=3];
5638[label="vuz39/Zero",fontsize=10,color="white",style="solid",shape="box"];3863 -> 5638[label="",style="solid", color="burlywood", weight=9];
5638 -> 3882[label="",style="solid", color="burlywood", weight=3];
3864[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz39 (primGEqNatS Zero vuz39))) (Pos Zero)) (Integer (Pos (Succ vuz39))) (Integer (Pos (primModNatS0 Zero vuz39 (primGEqNatS Zero vuz39))))",fontsize=16,color="burlywood",shape="box"];5639[label="vuz39/Succ vuz390",fontsize=10,color="white",style="solid",shape="box"];3864 -> 5639[label="",style="solid", color="burlywood", weight=9];
5639 -> 3883[label="",style="solid", color="burlywood", weight=3];
5640[label="vuz39/Zero",fontsize=10,color="white",style="solid",shape="box"];3864 -> 5640[label="",style="solid", color="burlywood", weight=9];
5640 -> 3884[label="",style="solid", color="burlywood", weight=3];
3865[label="Neg (primDivNatS Zero (Succ vuz39))",fontsize=16,color="green",shape="box"];3865 -> 3885[label="",style="dashed", color="green", weight=3];
5364[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16500) (Succ vuz1570) (primGEqNatS (Succ vuz16500) (Succ vuz1570)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (primModNatS0 (Succ vuz16500) (Succ vuz1570) (primGEqNatS (Succ vuz16500) (Succ vuz1570)))))",fontsize=16,color="black",shape="box"];5364 -> 5415[label="",style="solid", color="black", weight=3];
5365[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16500) Zero (primGEqNatS (Succ vuz16500) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz16500) Zero (primGEqNatS (Succ vuz16500) Zero))))",fontsize=16,color="black",shape="box"];5365 -> 5416[label="",style="solid", color="black", weight=3];
5366[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1570) (primGEqNatS Zero (Succ vuz1570)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1570) (primGEqNatS Zero (Succ vuz1570)))))",fontsize=16,color="black",shape="box"];5366 -> 5417[label="",style="solid", color="black", weight=3];
5367[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];5367 -> 5418[label="",style="solid", color="black", weight=3];
5114[label="vuz143",fontsize=16,color="green",shape="box"];5115[label="Succ vuz142",fontsize=16,color="green",shape="box"];4762[label="primMinusNatS vuz1220 vuz123",fontsize=16,color="burlywood",shape="triangle"];5641[label="vuz1220/Succ vuz12200",fontsize=10,color="white",style="solid",shape="box"];4762 -> 5641[label="",style="solid", color="burlywood", weight=9];
5641 -> 4789[label="",style="solid", color="burlywood", weight=3];
5642[label="vuz1220/Zero",fontsize=10,color="white",style="solid",shape="box"];4762 -> 5642[label="",style="solid", color="burlywood", weight=9];
5642 -> 4790[label="",style="solid", color="burlywood", weight=3];
5116[label="vuz143",fontsize=16,color="green",shape="box"];5117[label="Succ vuz142",fontsize=16,color="green",shape="box"];5148[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz143))) (Integer (Pos (Succ (Succ vuz142))))",fontsize=16,color="black",shape="box"];5148 -> 5246[label="",style="solid", color="black", weight=3];
4406[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz98)) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz98)) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];4406 -> 4416[label="",style="solid", color="black", weight=3];
4000[label="primDivNatS0 (Succ vuz830000) vuz84 (primGEqNatS (Succ vuz830000) vuz84)",fontsize=16,color="burlywood",shape="box"];5643[label="vuz84/Succ vuz840",fontsize=10,color="white",style="solid",shape="box"];4000 -> 5643[label="",style="solid", color="burlywood", weight=9];
5643 -> 4024[label="",style="solid", color="burlywood", weight=3];
5644[label="vuz84/Zero",fontsize=10,color="white",style="solid",shape="box"];4000 -> 5644[label="",style="solid", color="burlywood", weight=9];
5644 -> 4025[label="",style="solid", color="burlywood", weight=3];
4001[label="primDivNatS0 Zero vuz84 (primGEqNatS Zero vuz84)",fontsize=16,color="burlywood",shape="box"];5645[label="vuz84/Succ vuz840",fontsize=10,color="white",style="solid",shape="box"];4001 -> 5645[label="",style="solid", color="burlywood", weight=9];
5645 -> 4026[label="",style="solid", color="burlywood", weight=3];
5646[label="vuz84/Zero",fontsize=10,color="white",style="solid",shape="box"];4001 -> 5646[label="",style="solid", color="burlywood", weight=9];
5646 -> 4027[label="",style="solid", color="burlywood", weight=3];
5329[label="Succ vuz1430",fontsize=16,color="green",shape="box"];5330[label="vuz141",fontsize=16,color="green",shape="box"];5331[label="Zero",fontsize=16,color="green",shape="box"];5332[label="Zero",fontsize=16,color="green",shape="box"];5333[label="Zero",fontsize=16,color="green",shape="box"];5334[label="Zero",fontsize=16,color="green",shape="box"];3839 -> 5084[label="",style="dashed", color="red", weight=0];
3839[label="Integer (Pos (Succ (Succ vuz80))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz81) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz81) Zero) (Succ Zero))))",fontsize=16,color="magenta"];3839 -> 5091[label="",style="dashed", color="magenta", weight=3];
3839 -> 5092[label="",style="dashed", color="magenta", weight=3];
3839 -> 5093[label="",style="dashed", color="magenta", weight=3];
3839 -> 5094[label="",style="dashed", color="magenta", weight=3];
3866[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3866 -> 3886[label="",style="solid", color="black", weight=3];
3881[label="Integer (Neg (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS (Succ vuz380000) (Succ vuz390)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS (Succ vuz380000) (Succ vuz390)))))",fontsize=16,color="black",shape="box"];3881 -> 3902[label="",style="solid", color="black", weight=3];
3882[label="Integer (Neg (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) Zero (primGEqNatS (Succ vuz380000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz380000) Zero (primGEqNatS (Succ vuz380000) Zero))))",fontsize=16,color="black",shape="box"];3882 -> 3903[label="",style="solid", color="black", weight=3];
3883[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz390) (primGEqNatS Zero (Succ vuz390)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 Zero (Succ vuz390) (primGEqNatS Zero (Succ vuz390)))))",fontsize=16,color="black",shape="box"];3883 -> 3904[label="",style="solid", color="black", weight=3];
3884[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3884 -> 3905[label="",style="solid", color="black", weight=3];
3885[label="primDivNatS Zero (Succ vuz39)",fontsize=16,color="black",shape="box"];3885 -> 3906[label="",style="solid", color="black", weight=3];
5415 -> 5149[label="",style="dashed", color="red", weight=0];
5415[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16500) (Succ vuz1570) (primGEqNatS vuz16500 vuz1570))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (primModNatS0 (Succ vuz16500) (Succ vuz1570) (primGEqNatS vuz16500 vuz1570))))",fontsize=16,color="magenta"];5415 -> 5422[label="",style="dashed", color="magenta", weight=3];
5415 -> 5423[label="",style="dashed", color="magenta", weight=3];
5415 -> 5424[label="",style="dashed", color="magenta", weight=3];
5415 -> 5425[label="",style="dashed", color="magenta", weight=3];
5416 -> 5268[label="",style="dashed", color="red", weight=0];
5416[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16500) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz16500) Zero True)))",fontsize=16,color="magenta"];5416 -> 5426[label="",style="dashed", color="magenta", weight=3];
5416 -> 5427[label="",style="dashed", color="magenta", weight=3];
5417[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1570) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1570) False)))",fontsize=16,color="black",shape="box"];5417 -> 5428[label="",style="solid", color="black", weight=3];
5418[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];5418 -> 5429[label="",style="solid", color="black", weight=3];
4789[label="primMinusNatS (Succ vuz12200) vuz123",fontsize=16,color="burlywood",shape="box"];5650[label="vuz123/Succ vuz1230",fontsize=10,color="white",style="solid",shape="box"];4789 -> 5650[label="",style="solid", color="burlywood", weight=9];
5650 -> 4832[label="",style="solid", color="burlywood", weight=3];
5651[label="vuz123/Zero",fontsize=10,color="white",style="solid",shape="box"];4789 -> 5651[label="",style="solid", color="burlywood", weight=9];
5651 -> 4833[label="",style="solid", color="burlywood", weight=3];
4790[label="primMinusNatS Zero vuz123",fontsize=16,color="burlywood",shape="box"];5652[label="vuz123/Succ vuz1230",fontsize=10,color="white",style="solid",shape="box"];4790 -> 5652[label="",style="solid", color="burlywood", weight=9];
5652 -> 4834[label="",style="solid", color="burlywood", weight=3];
5653[label="vuz123/Zero",fontsize=10,color="white",style="solid",shape="box"];4790 -> 5653[label="",style="solid", color="burlywood", weight=9];
5653 -> 4835[label="",style="solid", color="burlywood", weight=3];
5246[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz142)))) (Integer (Pos (Succ vuz143)) `rem` Integer (Pos (Succ (Succ vuz142))))",fontsize=16,color="black",shape="box"];5246 -> 5260[label="",style="solid", color="black", weight=3];
4416[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz98)) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ vuz98)) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];4416 -> 4455[label="",style="solid", color="black", weight=3];
4024[label="primDivNatS0 (Succ vuz830000) (Succ vuz840) (primGEqNatS (Succ vuz830000) (Succ vuz840))",fontsize=16,color="black",shape="box"];4024 -> 4051[label="",style="solid", color="black", weight=3];
4025[label="primDivNatS0 (Succ vuz830000) Zero (primGEqNatS (Succ vuz830000) Zero)",fontsize=16,color="black",shape="box"];4025 -> 4052[label="",style="solid", color="black", weight=3];
4026[label="primDivNatS0 Zero (Succ vuz840) (primGEqNatS Zero (Succ vuz840))",fontsize=16,color="black",shape="box"];4026 -> 4053[label="",style="solid", color="black", weight=3];
4027[label="primDivNatS0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];4027 -> 4054[label="",style="solid", color="black", weight=3];
5091 -> 4762[label="",style="dashed", color="red", weight=0];
5091[label="primMinusNatS (Succ vuz81) Zero",fontsize=16,color="magenta"];5091 -> 5118[label="",style="dashed", color="magenta", weight=3];
5091 -> 5119[label="",style="dashed", color="magenta", weight=3];
5092[label="vuz80",fontsize=16,color="green",shape="box"];5093[label="Zero",fontsize=16,color="green",shape="box"];5094 -> 4762[label="",style="dashed", color="red", weight=0];
5094[label="primMinusNatS (Succ vuz81) Zero",fontsize=16,color="magenta"];5094 -> 5120[label="",style="dashed", color="magenta", weight=3];
5094 -> 5121[label="",style="dashed", color="magenta", weight=3];
3886[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3886 -> 3907[label="",style="solid", color="black", weight=3];
3902 -> 5149[label="",style="dashed", color="red", weight=0];
3902[label="Integer (Neg (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS vuz380000 vuz390))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 (Succ vuz380000) (Succ vuz390) (primGEqNatS vuz380000 vuz390))))",fontsize=16,color="magenta"];3902 -> 5165[label="",style="dashed", color="magenta", weight=3];
3902 -> 5166[label="",style="dashed", color="magenta", weight=3];
3902 -> 5167[label="",style="dashed", color="magenta", weight=3];
3902 -> 5168[label="",style="dashed", color="magenta", weight=3];
3902 -> 5169[label="",style="dashed", color="magenta", weight=3];
3903 -> 3894[label="",style="dashed", color="red", weight=0];
3903[label="Integer (Neg (Succ (Succ vuz380000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz380000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz380000) Zero True)))",fontsize=16,color="magenta"];3903 -> 3928[label="",style="dashed", color="magenta", weight=3];
3903 -> 3929[label="",style="dashed", color="magenta", weight=3];
3904[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz390) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (primModNatS0 Zero (Succ vuz390) False)))",fontsize=16,color="black",shape="box"];3904 -> 3930[label="",style="solid", color="black", weight=3];
3905[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="triangle"];3905 -> 3931[label="",style="solid", color="black", weight=3];
3906[label="Zero",fontsize=16,color="green",shape="box"];5422[label="vuz16500",fontsize=16,color="green",shape="box"];5423[label="vuz16500",fontsize=16,color="green",shape="box"];5424[label="Succ vuz1570",fontsize=16,color="green",shape="box"];5425[label="vuz1570",fontsize=16,color="green",shape="box"];5149[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS vuz158 vuz159))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS vuz158 vuz159))))",fontsize=16,color="burlywood",shape="triangle"];5658[label="vuz158/Succ vuz1580",fontsize=10,color="white",style="solid",shape="box"];5149 -> 5658[label="",style="solid", color="burlywood", weight=9];
5658 -> 5244[label="",style="solid", color="burlywood", weight=3];
5659[label="vuz158/Zero",fontsize=10,color="white",style="solid",shape="box"];5149 -> 5659[label="",style="solid", color="burlywood", weight=9];
5659 -> 5245[label="",style="solid", color="burlywood", weight=3];
5426[label="vuz16500",fontsize=16,color="green",shape="box"];5427[label="Zero",fontsize=16,color="green",shape="box"];5268[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 True)) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 True)))",fontsize=16,color="black",shape="triangle"];5268 -> 5290[label="",style="solid", color="black", weight=3];
5428[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5428 -> 5435[label="",style="solid", color="black", weight=3];
5429 -> 5304[label="",style="dashed", color="red", weight=0];
5429[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];5429 -> 5436[label="",style="dashed", color="magenta", weight=3];
5429 -> 5437[label="",style="dashed", color="magenta", weight=3];
5429 -> 5438[label="",style="dashed", color="magenta", weight=3];
4832[label="primMinusNatS (Succ vuz12200) (Succ vuz1230)",fontsize=16,color="black",shape="box"];4832 -> 4842[label="",style="solid", color="black", weight=3];
4833[label="primMinusNatS (Succ vuz12200) Zero",fontsize=16,color="black",shape="box"];4833 -> 4843[label="",style="solid", color="black", weight=3];
4834[label="primMinusNatS Zero (Succ vuz1230)",fontsize=16,color="black",shape="box"];4834 -> 4844[label="",style="solid", color="black", weight=3];
4835[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="box"];4835 -> 4845[label="",style="solid", color="black", weight=3];
5260[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz142)))) (Integer (Pos (Succ vuz143)) `rem` Integer (Pos (Succ (Succ vuz142))))",fontsize=16,color="black",shape="box"];5260 -> 5271[label="",style="solid", color="black", weight=3];
4455[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz98)) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ vuz98)) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];4455 -> 4502[label="",style="solid", color="black", weight=3];
4051 -> 5374[label="",style="dashed", color="red", weight=0];
4051[label="primDivNatS0 (Succ vuz830000) (Succ vuz840) (primGEqNatS vuz830000 vuz840)",fontsize=16,color="magenta"];4051 -> 5375[label="",style="dashed", color="magenta", weight=3];
4051 -> 5376[label="",style="dashed", color="magenta", weight=3];
4051 -> 5377[label="",style="dashed", color="magenta", weight=3];
4051 -> 5378[label="",style="dashed", color="magenta", weight=3];
4052[label="primDivNatS0 (Succ vuz830000) Zero True",fontsize=16,color="black",shape="box"];4052 -> 4080[label="",style="solid", color="black", weight=3];
4053[label="primDivNatS0 Zero (Succ vuz840) False",fontsize=16,color="black",shape="box"];4053 -> 4081[label="",style="solid", color="black", weight=3];
4054[label="primDivNatS0 Zero Zero True",fontsize=16,color="black",shape="box"];4054 -> 4082[label="",style="solid", color="black", weight=3];
5118[label="Zero",fontsize=16,color="green",shape="box"];5119[label="Succ vuz81",fontsize=16,color="green",shape="box"];5120[label="Zero",fontsize=16,color="green",shape="box"];5121[label="Succ vuz81",fontsize=16,color="green",shape="box"];3907[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3907 -> 3932[label="",style="solid", color="black", weight=3];
5165[label="vuz380000",fontsize=16,color="green",shape="box"];5166[label="vuz380000",fontsize=16,color="green",shape="box"];5167[label="Succ vuz390",fontsize=16,color="green",shape="box"];5168[label="vuz380000",fontsize=16,color="green",shape="box"];5169[label="vuz390",fontsize=16,color="green",shape="box"];3928[label="vuz380000",fontsize=16,color="green",shape="box"];3929[label="vuz380000",fontsize=16,color="green",shape="box"];3894[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz79) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz79) Zero True)))",fontsize=16,color="black",shape="triangle"];3894 -> 3915[label="",style="solid", color="black", weight=3];
3930[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3930 -> 3950[label="",style="solid", color="black", weight=3];
3931 -> 4571[label="",style="dashed", color="red", weight=0];
3931[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];3931 -> 4572[label="",style="dashed", color="magenta", weight=3];
3931 -> 4573[label="",style="dashed", color="magenta", weight=3];
5244[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS (Succ vuz1580) vuz159))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS (Succ vuz1580) vuz159))))",fontsize=16,color="burlywood",shape="box"];5663[label="vuz159/Succ vuz1590",fontsize=10,color="white",style="solid",shape="box"];5244 -> 5663[label="",style="solid", color="burlywood", weight=9];
5663 -> 5256[label="",style="solid", color="burlywood", weight=3];
5664[label="vuz159/Zero",fontsize=10,color="white",style="solid",shape="box"];5244 -> 5664[label="",style="solid", color="burlywood", weight=9];
5664 -> 5257[label="",style="solid", color="burlywood", weight=3];
5245[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS Zero vuz159))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS Zero vuz159))))",fontsize=16,color="burlywood",shape="box"];5665[label="vuz159/Succ vuz1590",fontsize=10,color="white",style="solid",shape="box"];5245 -> 5665[label="",style="solid", color="burlywood", weight=9];
5665 -> 5258[label="",style="solid", color="burlywood", weight=3];
5666[label="vuz159/Zero",fontsize=10,color="white",style="solid",shape="box"];5245 -> 5666[label="",style="solid", color="burlywood", weight=9];
5666 -> 5259[label="",style="solid", color="burlywood", weight=3];
5290 -> 5304[label="",style="dashed", color="red", weight=0];
5290[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz156) vuz157) (Succ vuz157))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz156) vuz157) (Succ vuz157))))",fontsize=16,color="magenta"];5290 -> 5309[label="",style="dashed", color="magenta", weight=3];
5290 -> 5310[label="",style="dashed", color="magenta", weight=3];
5435[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5435 -> 5444[label="",style="solid", color="black", weight=3];
5436 -> 4762[label="",style="dashed", color="red", weight=0];
5436[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];5436 -> 5445[label="",style="dashed", color="magenta", weight=3];
5436 -> 5446[label="",style="dashed", color="magenta", weight=3];
5437[label="Zero",fontsize=16,color="green",shape="box"];5438 -> 4762[label="",style="dashed", color="red", weight=0];
5438[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];5438 -> 5447[label="",style="dashed", color="magenta", weight=3];
5438 -> 5448[label="",style="dashed", color="magenta", weight=3];
4842 -> 4762[label="",style="dashed", color="red", weight=0];
4842[label="primMinusNatS vuz12200 vuz1230",fontsize=16,color="magenta"];4842 -> 4890[label="",style="dashed", color="magenta", weight=3];
4842 -> 4891[label="",style="dashed", color="magenta", weight=3];
4843[label="Succ vuz12200",fontsize=16,color="green",shape="box"];4844[label="Zero",fontsize=16,color="green",shape="box"];4845[label="Zero",fontsize=16,color="green",shape="box"];5271[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz143)) `rem` Integer (Pos (Succ (Succ vuz142))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz142)))) (Integer (Pos (Succ vuz143)) `rem` Integer (Pos (Succ (Succ vuz142))))",fontsize=16,color="black",shape="box"];5271 -> 5292[label="",style="solid", color="black", weight=3];
4502[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz98)) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ vuz98)) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];4502 -> 4521[label="",style="solid", color="black", weight=3];
5375[label="vuz840",fontsize=16,color="green",shape="box"];5376[label="vuz840",fontsize=16,color="green",shape="box"];5377[label="vuz830000",fontsize=16,color="green",shape="box"];5378[label="vuz830000",fontsize=16,color="green",shape="box"];5374[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS vuz177 vuz178)",fontsize=16,color="burlywood",shape="triangle"];5671[label="vuz177/Succ vuz1770",fontsize=10,color="white",style="solid",shape="box"];5374 -> 5671[label="",style="solid", color="burlywood", weight=9];
5671 -> 5419[label="",style="solid", color="burlywood", weight=3];
5672[label="vuz177/Zero",fontsize=10,color="white",style="solid",shape="box"];5374 -> 5672[label="",style="solid", color="burlywood", weight=9];
5672 -> 5420[label="",style="solid", color="burlywood", weight=3];
4080[label="Succ (primDivNatS (primMinusNatS (Succ vuz830000) Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];4080 -> 4111[label="",style="dashed", color="green", weight=3];
4081[label="Zero",fontsize=16,color="green",shape="box"];4082[label="Succ (primDivNatS (primMinusNatS Zero Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];4082 -> 4112[label="",style="dashed", color="green", weight=3];
3932[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3932 -> 3952[label="",style="solid", color="black", weight=3];
3915 -> 5304[label="",style="dashed", color="red", weight=0];
3915[label="Integer (Neg (Succ (Succ vuz78))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz79) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz79) Zero) (Succ Zero))))",fontsize=16,color="magenta"];3915 -> 5311[label="",style="dashed", color="magenta", weight=3];
3915 -> 5312[label="",style="dashed", color="magenta", weight=3];
3915 -> 5313[label="",style="dashed", color="magenta", weight=3];
3915 -> 5314[label="",style="dashed", color="magenta", weight=3];
3950[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3950 -> 3972[label="",style="solid", color="black", weight=3];
4572 -> 4143[label="",style="dashed", color="red", weight=0];
4572[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];4573 -> 4143[label="",style="dashed", color="red", weight=0];
4573[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];4571[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz112 (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS vuz111 (Succ Zero))))",fontsize=16,color="burlywood",shape="triangle"];5676[label="vuz112/Succ vuz1120",fontsize=10,color="white",style="solid",shape="box"];4571 -> 5676[label="",style="solid", color="burlywood", weight=9];
5676 -> 4580[label="",style="solid", color="burlywood", weight=3];
5677[label="vuz112/Zero",fontsize=10,color="white",style="solid",shape="box"];4571 -> 5677[label="",style="solid", color="burlywood", weight=9];
5677 -> 4581[label="",style="solid", color="burlywood", weight=3];
5256[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS (Succ vuz1580) (Succ vuz1590)))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS (Succ vuz1580) (Succ vuz1590)))))",fontsize=16,color="black",shape="box"];5256 -> 5267[label="",style="solid", color="black", weight=3];
5257[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS (Succ vuz1580) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS (Succ vuz1580) Zero))))",fontsize=16,color="black",shape="box"];5257 -> 5268[label="",style="solid", color="black", weight=3];
5258[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS Zero (Succ vuz1590)))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS Zero (Succ vuz1590)))))",fontsize=16,color="black",shape="box"];5258 -> 5269[label="",style="solid", color="black", weight=3];
5259[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];5259 -> 5270[label="",style="solid", color="black", weight=3];
5309 -> 4762[label="",style="dashed", color="red", weight=0];
5309[label="primMinusNatS (Succ vuz156) vuz157",fontsize=16,color="magenta"];5309 -> 5341[label="",style="dashed", color="magenta", weight=3];
5309 -> 5342[label="",style="dashed", color="magenta", weight=3];
5310 -> 4762[label="",style="dashed", color="red", weight=0];
5310[label="primMinusNatS (Succ vuz156) vuz157",fontsize=16,color="magenta"];5310 -> 5343[label="",style="dashed", color="magenta", weight=3];
5310 -> 5344[label="",style="dashed", color="magenta", weight=3];
5444[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz1570)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5444 -> 5454[label="",style="solid", color="black", weight=3];
5445[label="Zero",fontsize=16,color="green",shape="box"];5446[label="Zero",fontsize=16,color="green",shape="box"];5447[label="Zero",fontsize=16,color="green",shape="box"];5448[label="Zero",fontsize=16,color="green",shape="box"];4890[label="vuz1230",fontsize=16,color="green",shape="box"];4891[label="vuz12200",fontsize=16,color="green",shape="box"];5292[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz143)) (Pos (Succ (Succ vuz142)))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz142)))) (Integer (primRemInt (Pos (Succ vuz143)) (Pos (Succ (Succ vuz142)))))",fontsize=16,color="black",shape="box"];5292 -> 5335[label="",style="solid", color="black", weight=3];
4521 -> 5084[label="",style="dashed", color="red", weight=0];
4521[label="Integer (Pos (Succ (Succ vuz97))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz98) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz98) (Succ Zero))))",fontsize=16,color="magenta"];4521 -> 5099[label="",style="dashed", color="magenta", weight=3];
4521 -> 5100[label="",style="dashed", color="magenta", weight=3];
4521 -> 5101[label="",style="dashed", color="magenta", weight=3];
4521 -> 5102[label="",style="dashed", color="magenta", weight=3];
5419[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS (Succ vuz1770) vuz178)",fontsize=16,color="burlywood",shape="box"];5681[label="vuz178/Succ vuz1780",fontsize=10,color="white",style="solid",shape="box"];5419 -> 5681[label="",style="solid", color="burlywood", weight=9];
5681 -> 5430[label="",style="solid", color="burlywood", weight=3];
5682[label="vuz178/Zero",fontsize=10,color="white",style="solid",shape="box"];5419 -> 5682[label="",style="solid", color="burlywood", weight=9];
5682 -> 5431[label="",style="solid", color="burlywood", weight=3];
5420[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS Zero vuz178)",fontsize=16,color="burlywood",shape="box"];5683[label="vuz178/Succ vuz1780",fontsize=10,color="white",style="solid",shape="box"];5420 -> 5683[label="",style="solid", color="burlywood", weight=9];
5683 -> 5432[label="",style="solid", color="burlywood", weight=3];
5684[label="vuz178/Zero",fontsize=10,color="white",style="solid",shape="box"];5420 -> 5684[label="",style="solid", color="burlywood", weight=9];
5684 -> 5433[label="",style="solid", color="burlywood", weight=3];
4111 -> 3933[label="",style="dashed", color="red", weight=0];
4111[label="primDivNatS (primMinusNatS (Succ vuz830000) Zero) (Succ Zero)",fontsize=16,color="magenta"];4111 -> 4141[label="",style="dashed", color="magenta", weight=3];
4111 -> 4142[label="",style="dashed", color="magenta", weight=3];
4112 -> 3933[label="",style="dashed", color="red", weight=0];
4112[label="primDivNatS (primMinusNatS Zero Zero) (Succ Zero)",fontsize=16,color="magenta"];4112 -> 4143[label="",style="dashed", color="magenta", weight=3];
4112 -> 4144[label="",style="dashed", color="magenta", weight=3];
3952 -> 3754[label="",style="dashed", color="red", weight=0];
3952[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];3952 -> 3975[label="",style="dashed", color="magenta", weight=3];
3952 -> 3976[label="",style="dashed", color="magenta", weight=3];
5311 -> 4762[label="",style="dashed", color="red", weight=0];
5311[label="primMinusNatS (Succ vuz79) Zero",fontsize=16,color="magenta"];5311 -> 5336[label="",style="dashed", color="magenta", weight=3];
5311 -> 5337[label="",style="dashed", color="magenta", weight=3];
5312[label="Zero",fontsize=16,color="green",shape="box"];5313[label="vuz78",fontsize=16,color="green",shape="box"];5314 -> 4762[label="",style="dashed", color="red", weight=0];
5314[label="primMinusNatS (Succ vuz79) Zero",fontsize=16,color="magenta"];5314 -> 5338[label="",style="dashed", color="magenta", weight=3];
5314 -> 5339[label="",style="dashed", color="magenta", weight=3];
3972[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz390)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3972 -> 3999[label="",style="solid", color="black", weight=3];
4143[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="triangle"];4143 -> 4158[label="",style="solid", color="black", weight=3];
4580[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1120) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS vuz111 (Succ Zero))))",fontsize=16,color="black",shape="box"];4580 -> 4610[label="",style="solid", color="black", weight=3];
4581[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS vuz111 (Succ Zero))))",fontsize=16,color="black",shape="box"];4581 -> 4611[label="",style="solid", color="black", weight=3];
5267 -> 5149[label="",style="dashed", color="red", weight=0];
5267[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS vuz1580 vuz1590))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 (primGEqNatS vuz1580 vuz1590))))",fontsize=16,color="magenta"];5267 -> 5288[label="",style="dashed", color="magenta", weight=3];
5267 -> 5289[label="",style="dashed", color="magenta", weight=3];
5269[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 False)) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 False)))",fontsize=16,color="black",shape="box"];5269 -> 5291[label="",style="solid", color="black", weight=3];
5270 -> 5268[label="",style="dashed", color="red", weight=0];
5270[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz156) vuz157 True)) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (primModNatS0 (Succ vuz156) vuz157 True)))",fontsize=16,color="magenta"];5341[label="vuz157",fontsize=16,color="green",shape="box"];5342[label="Succ vuz156",fontsize=16,color="green",shape="box"];5343[label="vuz157",fontsize=16,color="green",shape="box"];5344[label="Succ vuz156",fontsize=16,color="green",shape="box"];5454[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1570))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5454 -> 5457[label="",style="solid", color="black", weight=3];
5335[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz143)) (Pos (Succ (Succ vuz142)))) == Integer (Pos Zero)) (Integer (Pos (Succ (Succ vuz142)))) (Integer (primRemInt (Pos (Succ vuz143)) (Pos (Succ (Succ vuz142)))))",fontsize=16,color="black",shape="box"];5335 -> 5351[label="",style="solid", color="black", weight=3];
5099[label="Succ vuz98",fontsize=16,color="green",shape="box"];5100[label="vuz97",fontsize=16,color="green",shape="box"];5101[label="Zero",fontsize=16,color="green",shape="box"];5102[label="Succ vuz98",fontsize=16,color="green",shape="box"];5430[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS (Succ vuz1770) (Succ vuz1780))",fontsize=16,color="black",shape="box"];5430 -> 5439[label="",style="solid", color="black", weight=3];
5431[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS (Succ vuz1770) Zero)",fontsize=16,color="black",shape="box"];5431 -> 5440[label="",style="solid", color="black", weight=3];
5432[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS Zero (Succ vuz1780))",fontsize=16,color="black",shape="box"];5432 -> 5441[label="",style="solid", color="black", weight=3];
5433[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];5433 -> 5442[label="",style="solid", color="black", weight=3];
4141[label="primMinusNatS (Succ vuz830000) Zero",fontsize=16,color="black",shape="triangle"];4141 -> 4157[label="",style="solid", color="black", weight=3];
4142[label="Zero",fontsize=16,color="green",shape="box"];4144[label="Zero",fontsize=16,color="green",shape="box"];3975[label="Zero",fontsize=16,color="green",shape="box"];3976[label="Succ vuz390",fontsize=16,color="green",shape="box"];5336[label="Zero",fontsize=16,color="green",shape="box"];5337[label="Succ vuz79",fontsize=16,color="green",shape="box"];5338[label="Zero",fontsize=16,color="green",shape="box"];5339[label="Succ vuz79",fontsize=16,color="green",shape="box"];3999[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];3999 -> 4023[label="",style="solid", color="black", weight=3];
4158[label="Zero",fontsize=16,color="green",shape="box"];4610[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1120 Zero (primGEqNatS vuz1120 Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 vuz1120 Zero (primGEqNatS vuz1120 Zero))))",fontsize=16,color="burlywood",shape="box"];5692[label="vuz1120/Succ vuz11200",fontsize=10,color="white",style="solid",shape="box"];4610 -> 5692[label="",style="solid", color="burlywood", weight=9];
5692 -> 4616[label="",style="solid", color="burlywood", weight=3];
5693[label="vuz1120/Zero",fontsize=10,color="white",style="solid",shape="box"];4610 -> 5693[label="",style="solid", color="burlywood", weight=9];
5693 -> 4617[label="",style="solid", color="burlywood", weight=3];
4611 -> 3802[label="",style="dashed", color="red", weight=0];
4611[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos Zero))",fontsize=16,color="magenta"];4611 -> 4618[label="",style="dashed", color="magenta", weight=3];
4611 -> 4619[label="",style="dashed", color="magenta", weight=3];
5288[label="vuz1580",fontsize=16,color="green",shape="box"];5289[label="vuz1590",fontsize=16,color="green",shape="box"];5291[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz156))) (Pos Zero)) (Integer (Pos (Succ vuz157))) (Integer (Pos (Succ (Succ vuz156))))",fontsize=16,color="black",shape="box"];5291 -> 5340[label="",style="solid", color="black", weight=3];
5457[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1570))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5457 -> 5463[label="",style="solid", color="black", weight=3];
5351[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz143)) (Pos (Succ (Succ vuz142)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz142)))) (Integer (primRemInt (Pos (Succ vuz143)) (Pos (Succ (Succ vuz142)))))",fontsize=16,color="black",shape="box"];5351 -> 5360[label="",style="solid", color="black", weight=3];
5439 -> 5374[label="",style="dashed", color="red", weight=0];
5439[label="primDivNatS0 (Succ vuz175) (Succ vuz176) (primGEqNatS vuz1770 vuz1780)",fontsize=16,color="magenta"];5439 -> 5449[label="",style="dashed", color="magenta", weight=3];
5439 -> 5450[label="",style="dashed", color="magenta", weight=3];
5440[label="primDivNatS0 (Succ vuz175) (Succ vuz176) True",fontsize=16,color="black",shape="triangle"];5440 -> 5451[label="",style="solid", color="black", weight=3];
5441[label="primDivNatS0 (Succ vuz175) (Succ vuz176) False",fontsize=16,color="black",shape="box"];5441 -> 5452[label="",style="solid", color="black", weight=3];
5442 -> 5440[label="",style="dashed", color="red", weight=0];
5442[label="primDivNatS0 (Succ vuz175) (Succ vuz176) True",fontsize=16,color="magenta"];4157[label="Succ vuz830000",fontsize=16,color="green",shape="box"];4023[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];4023 -> 4050[label="",style="solid", color="black", weight=3];
4616[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz11200) Zero (primGEqNatS (Succ vuz11200) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz11200) Zero (primGEqNatS (Succ vuz11200) Zero))))",fontsize=16,color="black",shape="box"];4616 -> 4722[label="",style="solid", color="black", weight=3];
4617[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];4617 -> 4723[label="",style="solid", color="black", weight=3];
4618[label="Neg (Succ Zero)",fontsize=16,color="green",shape="box"];4619[label="Zero",fontsize=16,color="green",shape="box"];5340[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz157))) (Integer (Pos (Succ (Succ vuz156))))",fontsize=16,color="black",shape="box"];5340 -> 5352[label="",style="solid", color="black", weight=3];
5463[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz1570))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1570))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];5463 -> 5466[label="",style="solid", color="black", weight=3];
5360 -> 5084[label="",style="dashed", color="red", weight=0];
5360[label="Integer (Pos (Succ (Succ vuz141))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz143) (Succ (Succ vuz142)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz142)))) (Integer (Pos (primModNatS (Succ vuz143) (Succ (Succ vuz142)))))",fontsize=16,color="magenta"];5360 -> 5368[label="",style="dashed", color="magenta", weight=3];
5360 -> 5369[label="",style="dashed", color="magenta", weight=3];
5360 -> 5370[label="",style="dashed", color="magenta", weight=3];
5449[label="vuz1780",fontsize=16,color="green",shape="box"];5450[label="vuz1770",fontsize=16,color="green",shape="box"];5451[label="Succ (primDivNatS (primMinusNatS (Succ vuz175) (Succ vuz176)) (Succ (Succ vuz176)))",fontsize=16,color="green",shape="box"];5451 -> 5455[label="",style="dashed", color="green", weight=3];
5452[label="Zero",fontsize=16,color="green",shape="box"];4050[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz390))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];4050 -> 4077[label="",style="solid", color="black", weight=3];
4722[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz11200) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz11200) Zero True)))",fontsize=16,color="black",shape="box"];4722 -> 4764[label="",style="solid", color="black", weight=3];
4723 -> 3905[label="",style="dashed", color="red", weight=0];
4723[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];5352[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz157))) (Integer (Pos (Succ (Succ vuz156))))",fontsize=16,color="black",shape="box"];5352 -> 5361[label="",style="solid", color="black", weight=3];
5466[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1570))) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1570))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];5466 -> 5467[label="",style="solid", color="black", weight=3];
5368[label="Succ vuz143",fontsize=16,color="green",shape="box"];5369[label="Succ vuz142",fontsize=16,color="green",shape="box"];5370[label="Succ vuz143",fontsize=16,color="green",shape="box"];5455 -> 3933[label="",style="dashed", color="red", weight=0];
5455[label="primDivNatS (primMinusNatS (Succ vuz175) (Succ vuz176)) (Succ (Succ vuz176))",fontsize=16,color="magenta"];5455 -> 5458[label="",style="dashed", color="magenta", weight=3];
5455 -> 5459[label="",style="dashed", color="magenta", weight=3];
4077[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz390))) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz390))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];4077 -> 4106[label="",style="solid", color="black", weight=3];
4764 -> 4571[label="",style="dashed", color="red", weight=0];
4764[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz11200) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz11200) Zero) (Succ Zero))))",fontsize=16,color="magenta"];4764 -> 4791[label="",style="dashed", color="magenta", weight=3];
4764 -> 4792[label="",style="dashed", color="magenta", weight=3];
5361[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz156)))) (Integer (Pos (Succ vuz157)) `rem` Integer (Pos (Succ (Succ vuz156))))",fontsize=16,color="black",shape="box"];5361 -> 5371[label="",style="solid", color="black", weight=3];
5467[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1570))) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1570))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];5467 -> 5468[label="",style="solid", color="black", weight=3];
5458 -> 4762[label="",style="dashed", color="red", weight=0];
5458[label="primMinusNatS (Succ vuz175) (Succ vuz176)",fontsize=16,color="magenta"];5458 -> 5464[label="",style="dashed", color="magenta", weight=3];
5458 -> 5465[label="",style="dashed", color="magenta", weight=3];
5459[label="Succ vuz176",fontsize=16,color="green",shape="box"];4106[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz390))) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz390))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];4106 -> 4136[label="",style="solid", color="black", weight=3];
4791 -> 4762[label="",style="dashed", color="red", weight=0];
4791[label="primMinusNatS (Succ vuz11200) Zero",fontsize=16,color="magenta"];4791 -> 4836[label="",style="dashed", color="magenta", weight=3];
4791 -> 4837[label="",style="dashed", color="magenta", weight=3];
4792 -> 4762[label="",style="dashed", color="red", weight=0];
4792[label="primMinusNatS (Succ vuz11200) Zero",fontsize=16,color="magenta"];4792 -> 4838[label="",style="dashed", color="magenta", weight=3];
4792 -> 4839[label="",style="dashed", color="magenta", weight=3];
5371[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz156)))) (Integer (Pos (Succ vuz157)) `rem` Integer (Pos (Succ (Succ vuz156))))",fontsize=16,color="black",shape="box"];5371 -> 5421[label="",style="solid", color="black", weight=3];
5468 -> 3820[label="",style="dashed", color="red", weight=0];
5468[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz1570))) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1570))) (Pos (Succ Zero))))",fontsize=16,color="magenta"];5468 -> 5469[label="",style="dashed", color="magenta", weight=3];
5468 -> 5470[label="",style="dashed", color="magenta", weight=3];
5468 -> 5471[label="",style="dashed", color="magenta", weight=3];
5464[label="Succ vuz176",fontsize=16,color="green",shape="box"];5465[label="Succ vuz175",fontsize=16,color="green",shape="box"];4136[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz390))) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz390))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];4136 -> 4304[label="",style="solid", color="black", weight=3];
4836[label="Zero",fontsize=16,color="green",shape="box"];4837[label="Succ vuz11200",fontsize=16,color="green",shape="box"];4838[label="Zero",fontsize=16,color="green",shape="box"];4839[label="Succ vuz11200",fontsize=16,color="green",shape="box"];5421[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz157)) `rem` Integer (Pos (Succ (Succ vuz156))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz156)))) (Integer (Pos (Succ vuz157)) `rem` Integer (Pos (Succ (Succ vuz156))))",fontsize=16,color="black",shape="box"];5421 -> 5434[label="",style="solid", color="black", weight=3];
5469[label="Zero",fontsize=16,color="green",shape="box"];5470[label="vuz1570",fontsize=16,color="green",shape="box"];5471[label="vuz155",fontsize=16,color="green",shape="box"];4304 -> 4571[label="",style="dashed", color="red", weight=0];
4304[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ (Succ vuz390)) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ (Succ vuz390)) (Succ Zero))))",fontsize=16,color="magenta"];4304 -> 4576[label="",style="dashed", color="magenta", weight=3];
4304 -> 4577[label="",style="dashed", color="magenta", weight=3];
5434[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz157)) (Pos (Succ (Succ vuz156)))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz156)))) (Integer (primRemInt (Pos (Succ vuz157)) (Pos (Succ (Succ vuz156)))))",fontsize=16,color="black",shape="box"];5434 -> 5443[label="",style="solid", color="black", weight=3];
4576[label="Succ (Succ vuz390)",fontsize=16,color="green",shape="box"];4577[label="Succ (Succ vuz390)",fontsize=16,color="green",shape="box"];5443[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz157)) (Pos (Succ (Succ vuz156)))) == Integer (Pos Zero)) (Integer (Pos (Succ (Succ vuz156)))) (Integer (primRemInt (Pos (Succ vuz157)) (Pos (Succ (Succ vuz156)))))",fontsize=16,color="black",shape="box"];5443 -> 5453[label="",style="solid", color="black", weight=3];
5453[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz157)) (Pos (Succ (Succ vuz156)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz156)))) (Integer (primRemInt (Pos (Succ vuz157)) (Pos (Succ (Succ vuz156)))))",fontsize=16,color="black",shape="box"];5453 -> 5456[label="",style="solid", color="black", weight=3];
5456 -> 5304[label="",style="dashed", color="red", weight=0];
5456[label="Integer (Neg (Succ (Succ vuz155))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz157) (Succ (Succ vuz156)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz156)))) (Integer (Pos (primModNatS (Succ vuz157) (Succ (Succ vuz156)))))",fontsize=16,color="magenta"];5456 -> 5460[label="",style="dashed", color="magenta", weight=3];
5456 -> 5461[label="",style="dashed", color="magenta", weight=3];
5456 -> 5462[label="",style="dashed", color="magenta", weight=3];
5460[label="Succ vuz157",fontsize=16,color="green",shape="box"];5461[label="Succ vuz156",fontsize=16,color="green",shape="box"];5462[label="Succ vuz157",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNatS(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS(vuz12200, vuz1230)

From the DPs we obtained the following set of size-change graphs:

new_primMinusNatS(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS(vuz12200, vuz1230)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))
new_primDivNatS(Succ(Succ(vuz830000)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz830000), Zero)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))
new_primDivNatS(Succ(Zero), Zero) → new_primDivNatS(new_primMinusNatS1, Zero)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz830000) → Succ(vuz830000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz830000)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz830000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz830000) → Succ(vuz830000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz830000)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz830000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vuz830000) → Succ(vuz830000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ RuleRemovalProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz830000)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz830000), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vuz830000) → Succ(vuz830000)

The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_primDivNatS(Succ(Succ(vuz830000)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz830000), Zero)

Strictly oriented rules of the TRS R:

new_primMinusNatS0(vuz830000) → Succ(vuz830000)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primDivNatS(x₁, x₂)) = x₁ + x₂
POL(new_primMinusNatS0(x₁)) = 2 + 2·x₁

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ RuleRemovalProof

                                            ↳ QDP

                                              ↳ PisEmptyProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz830000) → Succ(vuz830000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(x0)
new_primMinusNatS1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176)) at position [0] we obtained the following new rules:

new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz175), Succ(vuz176)), Succ(vuz176)) at position [0] we obtained the following new rules:

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_primDivNatS0(vuz175, vuz176, Zero, Zero) → new_primDivNatS00(vuz175, vuz176)
new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Zero) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))
new_primDivNatS(Succ(Succ(vuz830000)), Succ(vuz840)) → new_primDivNatS0(vuz830000, vuz840, vuz830000, vuz840)

The remaining pairs can at least be oriented weakly.

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primDivNatS(x₁, x₂)) = x₁
POL(new_primDivNatS0(x₁, x₂, x₃, x₄)) = 1 + x₁
POL(new_primDivNatS00(x₁, x₂)) = x₁
POL(new_primMinusNatS2(x₁, x₂)) = x₁

The following usable rules [17] were oriented:

new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
new_primDivNatS00(vuz175, vuz176) → new_primDivNatS(new_primMinusNatS2(vuz175, vuz176), Succ(vuz176))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)

From the DPs we obtained the following set of size-change graphs:

new_primDivNatS0(vuz175, vuz176, Succ(vuz1770), Succ(vuz1780)) → new_primDivNatS0(vuz175, vuz176, vuz1770, vuz1780)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot0 → new_quot(new_primMinusNatS1, new_primMinusNatS1)
new_quot(Succ(Succ(vuz11200)), vuz111) → new_quot(new_primMinusNatS2(Succ(vuz11200), Zero), new_primMinusNatS2(Succ(vuz11200), Zero))
new_quot(Succ(Zero), vuz111) → new_quot0

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS1 → Zero

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot(Succ(Succ(vuz11200)), vuz111) → new_quot(new_primMinusNatS2(Succ(vuz11200), Zero), new_primMinusNatS2(Succ(vuz11200), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS1 → Zero

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot(Succ(Succ(vuz11200)), vuz111) → new_quot(new_primMinusNatS2(Succ(vuz11200), Zero), new_primMinusNatS2(Succ(vuz11200), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                                      ↳ QDP

                                        ↳ RuleRemovalProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot(Succ(Succ(vuz11200)), vuz111) → new_quot(new_primMinusNatS2(Succ(vuz11200), Zero), new_primMinusNatS2(Succ(vuz11200), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

new_quot(Succ(Succ(vuz11200)), vuz111) → new_quot(new_primMinusNatS2(Succ(vuz11200), Zero), new_primMinusNatS2(Succ(vuz11200), Zero))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁ + 2·x₂
POL(new_quot(x₁, x₂)) = x₁ + x₂

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                                      ↳ QDP

                                        ↳ RuleRemovalProof

                                          ↳ QDP

                                            ↳ PisEmptyProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(vuz155, vuz156, vuz157) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Zero), Succ(vuz1570), vuz164) → new_quot4(vuz155, vuz1570, Zero)
new_quot2(vuz155, Succ(Zero), Zero, vuz164) → new_quot2(vuz155, new_primMinusNatS2(Zero, Zero), Zero, new_primMinusNatS2(Zero, Zero))
new_quot4(vuz78, vuz79, vuz48) → new_quot2(vuz78, Succ(Succ(vuz79)), vuz48, Succ(Succ(vuz79)))
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(vuz155, vuz156, vuz157) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Zero), Succ(vuz1570), vuz164) → new_quot4(vuz155, vuz1570, Zero)
new_quot4(vuz78, vuz79, vuz48) → new_quot2(vuz78, Succ(Succ(vuz79)), vuz48, Succ(Succ(vuz79)))
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot4(vuz78, vuz79, vuz48) → new_quot2(vuz78, Succ(Succ(vuz79)), vuz48, Succ(Succ(vuz79))) we obtained the following new rules:

new_quot4(z0, z1, Zero) → new_quot2(z0, Succ(Succ(z1)), Zero, Succ(Succ(z1)))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot3(vuz155, vuz156, vuz157) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot2(vuz155, Succ(Zero), Succ(vuz1570), vuz164) → new_quot4(vuz155, vuz1570, Zero)
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot4(z0, z1, Zero) → new_quot2(z0, Succ(Succ(z1)), Zero, Succ(Succ(z1)))
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_quot3(vuz155, vuz156, vuz157) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157)) at position [1] we obtained the following new rules:

new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))
new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1)))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1)))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Zero), Succ(vuz1570), vuz164) → new_quot4(vuz155, vuz1570, Zero)
new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))
new_quot4(z0, z1, Zero) → new_quot2(z0, Succ(Succ(z1)), Zero, Succ(Succ(z1)))
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero)) at position [3] we obtained the following new rules:

new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, Succ(x0))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, Succ(x0))

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Instantiation

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero)
new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot2(vuz155, Succ(Succ(vuz16500)), Zero, vuz164) → new_quot3(vuz155, vuz16500, Zero) we obtained the following new rules:

new_quot2(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot3(z0, x1, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Instantiation

                                                                ↳ QDP

                                                                  ↳ RuleRemovalProof

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, Succ(x0))
new_quot2(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot3(z0, x1, Zero)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_quot2(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot3(z0, x1, Zero)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_quot2(x₁, x₂, x₃, x₄)) = x₁ + x₂ + 2·x₃ + x₄
POL(new_quot3(x₁, x₂, x₃)) = 2 + x₁ + 2·x₂ + 2·x₃

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                              ↳ UsableRulesProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Instantiation

                                                                ↳ QDP

                                                                  ↳ RuleRemovalProof

                                                                    ↳ QDP

                                                                      ↳ DependencyGraphProof

                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot3(y0, x0, Zero) → new_quot2(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1)))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1))) at position [3] we obtained the following new rules:

new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(x0, x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(x0, x1))
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot3(y0, x0, Succ(x1)) → new_quot2(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(x0, x1))

The remaining pairs can at least be oriented weakly.

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( Succ(x₁) ) =

/	1	\
\	0	/

/	0	0	\
\	1	1	/

x₁

M( new_primMinusNatS2(x₁, x₂) ) =

/	1	\
\	0	/

/	0	0	\
\	0	1	/

x₁

/	0	0	\
\	0	0	/

x₂

M( Zero ) =

/	0	\
\	0	/

Tuple symbols:

M( new_quot1(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

M( new_quot2(x₁, ..., x₄) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

M( new_quot3(x₁, ..., x₃) ) =

[

]

x₁

[

]

x₂

[

]

x₃

Matrix type:
We used a basic matrix type which is not further parametrizeable.

As matrix orders are CE-compatible, we used usable rules w.r.t. argument filtering in the order.
The following usable rules [17] were oriented:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot1(vuz155, vuz156, vuz157, Zero, Zero) → new_quot3(vuz155, vuz156, vuz157)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))
new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Zero) → new_quot2(vuz155, new_primMinusNatS2(Succ(vuz156), vuz157), vuz157, new_primMinusNatS2(Succ(vuz156), vuz157))

The remaining pairs can at least be oriented weakly.

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( Succ(x₁) ) =

/	0	\
\	1	/

/	1	1	\
\	0	0	/

x₁

M( new_primMinusNatS2(x₁, x₂) ) =

/	0	\
\	0	/

/	1	0	\
\	0	0	/

x₁

/	0	0	\
\	1	0	/

x₂

M( Zero ) =

/	1	\
\	0	/

Tuple symbols:

M( new_quot1(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

M( new_quot2(x₁, ..., x₄) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)
new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ QReductionProof

                                                                    ↳ QDP

                                                                      ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot2(vuz155, Succ(Succ(vuz16500)), Succ(vuz1570), vuz164) → new_quot1(vuz155, vuz16500, Succ(vuz1570), vuz16500, vuz1570) we obtained the following new rules:

new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ QReductionProof

                                                                    ↳ QDP

                                                                      ↳ Instantiation

                                                                        ↳ QDP

                                                                          ↳ NonInfProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The DP Problem is simplified using the Induction Calculus [18] with the following steps:
Note that final constraints are written in bold face.

For Pair new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590) the following chains were created:

We consider the chain new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590), new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590) which results in the following constraint:
(1) (new_quot1(x0, x1, x2, x3, x4)=new_quot1(x5, x6, x7, Succ(x8), Succ(x9)) ⇒ new_quot1(x5, x6, x7, Succ(x8), Succ(x9))≥new_quot1(x5, x6, x7, x8, x9))

We simplified constraint (1) using rules (I), (II), (III) which results in the following new constraint:
(2) (new_quot1(x0, x1, x2, Succ(x8), Succ(x9))≥new_quot1(x0, x1, x2, x8, x9))
We consider the chain new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1), new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590) which results in the following constraint:
(3) (new_quot1(x14, x15, Succ(x16), x15, x16)=new_quot1(x17, x18, x19, Succ(x20), Succ(x21)) ⇒ new_quot1(x17, x18, x19, Succ(x20), Succ(x21))≥new_quot1(x17, x18, x19, x20, x21))

We simplified constraint (3) using rules (I), (II), (III) which results in the following new constraint:
(4) (new_quot1(x14, Succ(x20), Succ(Succ(x21)), Succ(x20), Succ(x21))≥new_quot1(x14, Succ(x20), Succ(Succ(x21)), x20, x21))

For Pair new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157)) the following chains were created:

We consider the chain new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590), new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157)) which results in the following constraint:
(5) (new_quot1(x22, x23, x24, x25, x26)=new_quot1(x27, x28, x29, Zero, Succ(x30)) ⇒ new_quot1(x27, x28, x29, Zero, Succ(x30))≥new_quot2(x27, Succ(x29), Succ(x28), Succ(x29)))

We simplified constraint (5) using rules (I), (II), (III) which results in the following new constraint:
(6) (new_quot1(x22, x23, x24, Zero, Succ(x30))≥new_quot2(x22, Succ(x24), Succ(x23), Succ(x24)))
We consider the chain new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1), new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157)) which results in the following constraint:
(7) (new_quot1(x35, x36, Succ(x37), x36, x37)=new_quot1(x38, x39, x40, Zero, Succ(x41)) ⇒ new_quot1(x38, x39, x40, Zero, Succ(x41))≥new_quot2(x38, Succ(x40), Succ(x39), Succ(x40)))

We simplified constraint (7) using rules (I), (II), (III) which results in the following new constraint:
(8) (new_quot1(x35, Zero, Succ(Succ(x41)), Zero, Succ(x41))≥new_quot2(x35, Succ(Succ(Succ(x41))), Succ(Zero), Succ(Succ(Succ(x41)))))

For Pair new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1) the following chains were created:

We consider the chain new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157)), new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1) which results in the following constraint:
(9) (new_quot2(x47, Succ(x49), Succ(x48), Succ(x49))=new_quot2(x51, Succ(Succ(x52)), Succ(x53), Succ(Succ(x52))) ⇒ new_quot2(x51, Succ(Succ(x52)), Succ(x53), Succ(Succ(x52)))≥new_quot1(x51, x52, Succ(x53), x52, x53))

We simplified constraint (9) using rules (I), (II), (III) which results in the following new constraint:
(10) (new_quot2(x47, Succ(Succ(x52)), Succ(x48), Succ(Succ(x52)))≥new_quot1(x47, x52, Succ(x48), x52, x48))

To summarize, we get the following constraints P_≥ for the following pairs.

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
- (new_quot1(x0, x1, x2, Succ(x8), Succ(x9))≥new_quot1(x0, x1, x2, x8, x9))
- (new_quot1(x14, Succ(x20), Succ(Succ(x21)), Succ(x20), Succ(x21))≥new_quot1(x14, Succ(x20), Succ(Succ(x21)), x20, x21))
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
- (new_quot1(x22, x23, x24, Zero, Succ(x30))≥new_quot2(x22, Succ(x24), Succ(x23), Succ(x24)))
- (new_quot1(x35, Zero, Succ(Succ(x41)), Zero, Succ(x41))≥new_quot2(x35, Succ(Succ(Succ(x41))), Succ(Zero), Succ(Succ(Succ(x41)))))
new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1)
- (new_quot2(x47, Succ(Succ(x52)), Succ(x48), Succ(Succ(x52)))≥new_quot1(x47, x52, Succ(x48), x52, x48))

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation [18]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(c) = -1
POL(new_quot1(x₁, x₂, x₃, x₄, x₅)) = x₁ + x₂ - x₄ + x₅
POL(new_quot2(x₁, x₂, x₃, x₄)) = x₁ - x₂ + x₃ + x₄

The following pairs are in P_>:

new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1)

The following pairs are in P_bound:

new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))
new_quot2(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot1(z0, x1, Succ(z1), x1, z1)

There are no usable rules

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ QReductionProof

                                                                    ↳ QDP

                                                                      ↳ Instantiation

                                                                        ↳ QDP

                                                                          ↳ NonInfProof

                                                                            ↳ QDP

                                                                              ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
new_quot1(vuz155, vuz156, vuz157, Zero, Succ(vuz1590)) → new_quot2(vuz155, Succ(vuz157), Succ(vuz156), Succ(vuz157))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ AND

                                            ↳ QDP

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ QDPOrderProof

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ QReductionProof

                                                                    ↳ QDP

                                                                      ↳ Instantiation

                                                                        ↳ QDP

                                                                          ↳ NonInfProof

                                                                            ↳ QDP

                                                                              ↳ DependencyGraphProof

                                                                                ↳ QDP

                                                                                  ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)

From the DPs we obtained the following set of size-change graphs:

new_quot1(vuz155, vuz156, vuz157, Succ(vuz1580), Succ(vuz1590)) → new_quot1(vuz155, vuz156, vuz157, vuz1580, vuz1590)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Zero), Zero, vuz152) → new_quot6(vuz141, new_primMinusNatS2(Zero, Zero), Zero, new_primMinusNatS2(Zero, Zero))
new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(vuz141, vuz142, vuz143) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))
new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))
new_quot8(vuz97, vuz98) → new_quot6(vuz97, Succ(vuz98), Zero, Succ(vuz98))
new_quot6(vuz141, Succ(Zero), Succ(vuz1430), vuz152) → new_quot8(vuz141, Succ(vuz1430))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(vuz141, vuz142, vuz143) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))
new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))
new_quot8(vuz97, vuz98) → new_quot6(vuz97, Succ(vuz98), Zero, Succ(vuz98))
new_quot6(vuz141, Succ(Zero), Succ(vuz1430), vuz152) → new_quot8(vuz141, Succ(vuz1430))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_quot7(vuz141, vuz142, vuz143) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143)) at position [1] we obtained the following new rules:

new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))
new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1)))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1)))
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot8(vuz97, vuz98) → new_quot6(vuz97, Succ(vuz98), Zero, Succ(vuz98))
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))
new_quot6(vuz141, Succ(Zero), Succ(vuz1430), vuz152) → new_quot8(vuz141, Succ(vuz1430))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, new_primMinusNatS2(Succ(x0), Zero)) at position [3] we obtained the following new rules:

new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, Succ(x0))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, Succ(x0))

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Instantiation

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero)
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot6(vuz141, Succ(Succ(vuz15300)), Zero, vuz152) → new_quot7(vuz141, vuz15300, Zero) we obtained the following new rules:

new_quot6(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot7(z0, x1, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Instantiation

                                                            ↳ QDP

                                                              ↳ RuleRemovalProof

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot7(z0, x1, Zero)
new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, Succ(x0))

new_quot6(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot7(z0, x1, Zero)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_quot6(x₁, x₂, x₃, x₄)) = x₁ + x₂ + 2·x₃ + x₄
POL(new_quot7(x₁, x₂, x₃)) = 2 + x₁ + 2·x₂ + 2·x₃

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Instantiation

                                                            ↳ QDP

                                                              ↳ RuleRemovalProof

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                        ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot7(y0, x0, Zero) → new_quot6(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1)))
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(Succ(x0), Succ(x1))) at position [3] we obtained the following new rules:

new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(x0, x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))
new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(x0, x1))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot7(y0, x0, Succ(x1)) → new_quot6(y0, new_primMinusNatS2(x0, x1), Succ(x1), new_primMinusNatS2(x0, x1))

The remaining pairs can at least be oriented weakly.

new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( Succ(x₁) ) =

/	0	\
\	1	/

/	1	1	\
\	0	0	/

x₁

M( new_primMinusNatS2(x₁, x₂) ) =

/	0	\
\	1	/

/	1	0	\
\	0	0	/

x₁

/	0	0	\
\	0	0	/

x₂

M( Zero ) =

/	0	\
\	0	/

Tuple symbols:

M( new_quot6(x₁, ..., x₄) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

M( new_quot5(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

M( new_quot7(x₁, ..., x₃) ) =

[

]

x₁

[

]

x₂

[

]

x₃

new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Zero, Zero) → new_quot7(vuz141, vuz142, vuz143)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Zero) → new_quot6(vuz141, new_primMinusNatS2(Succ(vuz142), vuz143), vuz143, new_primMinusNatS2(Succ(vuz142), vuz143))

The remaining pairs can at least be oriented weakly.

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( Succ(x₁) ) =

/	1	\
\	0	/

/	0	0	\
\	1	1	/

x₁

M( new_primMinusNatS2(x₁, x₂) ) =

/	1	\
\	0	/

/	0	0	\
\	0	1	/

x₁

/	0	0	\
\	0	0	/

x₂

M( Zero ) =

/	0	\
\	0	/

Tuple symbols:

M( new_quot6(x₁, ..., x₄) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

M( new_quot5(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12200), Succ(vuz1230)) → new_primMinusNatS2(vuz12200, vuz1230)
new_primMinusNatS2(Zero, Succ(vuz1230)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12200), Zero) → Succ(vuz12200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot6(vuz141, Succ(Succ(vuz15300)), Succ(vuz1430), vuz152) → new_quot5(vuz141, vuz15300, Succ(vuz1430), vuz15300, vuz1430) we obtained the following new rules:

new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonInfProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1)
new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The DP Problem is simplified using the Induction Calculus [18] with the following steps:
Note that final constraints are written in bold face.

For Pair new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450) the following chains were created:

We consider the chain new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450), new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450) which results in the following constraint:
(1) (new_quot5(x0, x1, x2, x3, x4)=new_quot5(x5, x6, x7, Succ(x8), Succ(x9)) ⇒ new_quot5(x5, x6, x7, Succ(x8), Succ(x9))≥new_quot5(x5, x6, x7, x8, x9))

We simplified constraint (1) using rules (I), (II), (III) which results in the following new constraint:
(2) (new_quot5(x0, x1, x2, Succ(x8), Succ(x9))≥new_quot5(x0, x1, x2, x8, x9))
We consider the chain new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1), new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450) which results in the following constraint:
(3) (new_quot5(x14, x15, Succ(x16), x15, x16)=new_quot5(x17, x18, x19, Succ(x20), Succ(x21)) ⇒ new_quot5(x17, x18, x19, Succ(x20), Succ(x21))≥new_quot5(x17, x18, x19, x20, x21))

We simplified constraint (3) using rules (I), (II), (III) which results in the following new constraint:
(4) (new_quot5(x14, Succ(x20), Succ(Succ(x21)), Succ(x20), Succ(x21))≥new_quot5(x14, Succ(x20), Succ(Succ(x21)), x20, x21))

For Pair new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143)) the following chains were created:

We consider the chain new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450), new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143)) which results in the following constraint:
(5) (new_quot5(x22, x23, x24, x25, x26)=new_quot5(x27, x28, x29, Zero, Succ(x30)) ⇒ new_quot5(x27, x28, x29, Zero, Succ(x30))≥new_quot6(x27, Succ(x29), Succ(x28), Succ(x29)))

We simplified constraint (5) using rules (I), (II), (III) which results in the following new constraint:
(6) (new_quot5(x22, x23, x24, Zero, Succ(x30))≥new_quot6(x22, Succ(x24), Succ(x23), Succ(x24)))
We consider the chain new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1), new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143)) which results in the following constraint:
(7) (new_quot5(x35, x36, Succ(x37), x36, x37)=new_quot5(x38, x39, x40, Zero, Succ(x41)) ⇒ new_quot5(x38, x39, x40, Zero, Succ(x41))≥new_quot6(x38, Succ(x40), Succ(x39), Succ(x40)))

We simplified constraint (7) using rules (I), (II), (III) which results in the following new constraint:
(8) (new_quot5(x35, Zero, Succ(Succ(x41)), Zero, Succ(x41))≥new_quot6(x35, Succ(Succ(Succ(x41))), Succ(Zero), Succ(Succ(Succ(x41)))))

For Pair new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1) the following chains were created:

We consider the chain new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143)), new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1) which results in the following constraint:
(9) (new_quot6(x47, Succ(x49), Succ(x48), Succ(x49))=new_quot6(x51, Succ(Succ(x52)), Succ(x53), Succ(Succ(x52))) ⇒ new_quot6(x51, Succ(Succ(x52)), Succ(x53), Succ(Succ(x52)))≥new_quot5(x51, x52, Succ(x53), x52, x53))

We simplified constraint (9) using rules (I), (II), (III) which results in the following new constraint:
(10) (new_quot6(x47, Succ(Succ(x52)), Succ(x48), Succ(Succ(x52)))≥new_quot5(x47, x52, Succ(x48), x52, x48))

To summarize, we get the following constraints P_≥ for the following pairs.

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
- (new_quot5(x0, x1, x2, Succ(x8), Succ(x9))≥new_quot5(x0, x1, x2, x8, x9))
- (new_quot5(x14, Succ(x20), Succ(Succ(x21)), Succ(x20), Succ(x21))≥new_quot5(x14, Succ(x20), Succ(Succ(x21)), x20, x21))
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
- (new_quot5(x22, x23, x24, Zero, Succ(x30))≥new_quot6(x22, Succ(x24), Succ(x23), Succ(x24)))
- (new_quot5(x35, Zero, Succ(Succ(x41)), Zero, Succ(x41))≥new_quot6(x35, Succ(Succ(Succ(x41))), Succ(Zero), Succ(Succ(Succ(x41)))))
new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1)
- (new_quot6(x47, Succ(Succ(x52)), Succ(x48), Succ(Succ(x52)))≥new_quot5(x47, x52, Succ(x48), x52, x48))

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(c) = -1
POL(new_quot5(x₁, x₂, x₃, x₄, x₅)) = 1 + x₁ + x₂ - x₄ + x₅
POL(new_quot6(x₁, x₂, x₃, x₄)) = 1 + x₁ + x₂ + x₃ - x₄

The following pairs are in P_>:

new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1)

The following pairs are in P_bound:

new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))
new_quot6(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot5(z0, x1, Succ(z1), x1, z1)

There are no usable rules

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonInfProof

                                                                        ↳ QDP

                                                                          ↳ DependencyGraphProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
new_quot5(vuz141, vuz142, vuz143, Zero, Succ(vuz1450)) → new_quot6(vuz141, Succ(vuz143), Succ(vuz142), Succ(vuz143))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonInfProof

                                                                        ↳ QDP

                                                                          ↳ DependencyGraphProof

                                                                            ↳ QDP

                                                                              ↳ QDPSizeChangeProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)

From the DPs we obtained the following set of size-change graphs:

new_quot5(vuz141, vuz142, vuz143, Succ(vuz1440), Succ(vuz1450)) → new_quot5(vuz141, vuz142, vuz143, vuz1440, vuz1450)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

new_quot9(Zero, Succ(vuz5000)) → new_quot9(Zero, vuz5000)

From the DPs we obtained the following set of size-change graphs:

new_quot9(Zero, Succ(vuz5000)) → new_quot9(Zero, vuz5000)
The graph contains the following edges 1 >= 1, 2 > 2

primDivNatS0	x y True	= Succ (primDivNatS (primMinusNatS x y) (Succ y))
primDivNatS0	x y False	= Zero

primModNatS0	x y True	= primModNatS (primMinusNatS x y) (Succ y)
primModNatS0	x y False	= Succ x

gcd2	True yz zu	= gcd1 (zu == 0) yz zu
gcd2	zy zz vuu	= gcd0 zz vuu

signumReal1	x True	= 1
signumReal1	x False	= signumReal0 x otherwise

signumReal2	x True	= 0
signumReal2	x False	= signumReal1 x (x > 0)

reduce2Reduce1	vux vuy x y True	= error []
reduce2Reduce1	vux vuy x y False	= reduce2Reduce0 vux vuy x y otherwise

gcd0Gcd'2	x xz	= gcd0Gcd'1 (xz == 0) x xz
gcd0Gcd'2	yx yy	= gcd0Gcd'0 yx yy